Skip to main content

Train Courses Problems Proof Blocks Tools Progress Account

⌄

AccountSign-in, membership, and settings Current courseCalculus IThemeAbout ProofAnvilLoading account…

Problem library

Find a problem

Search by course or topic.

Loading the problem library…

TrainCoursesProblemsProgressMoreTrain Courses Problems Progress

More

Proof Blocks Tools Account

ProofAnvil Practice$19 USD monthly · cancel any time

Pricing FAQ Features Roadmap Use with your agent Support Terms Privacy Refunds

Practice problems with hints and solutions · ProofAnvil

Problem library

Find a problem

Search by course or topic.

Search problems

Filters · 2 active

Area

AllMathPhysics

SubjectCourseTopic

Topic choices for Computer Architecture are shortened. Search still covers every problem.

StatusSkill

Skills match the applied subject and course.

Problem styleFind a private labelPrivate labelPrivate labels are visible only to you.Private labels ready.Favorites

Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available.

Progress labels

IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due

Problem results

Sort

ProblemsClear skill: IO Concurrency Build a practice set

ProblemCourse & topicStatus

ARCH:9923201Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923202Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923203Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923204Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923205A two-level cache hierarchy is accessed as follows.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923206A write-through L1 cache has hit time 1 cycle, miss rate 3.00\% on reads and writes combined, and miss penalty 40…

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923207A write-back L1 cache has hit time 1 cycle and miss rate 4.00\% (misses per reference).

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923208An in-order processor has a base CPI of 1.00 ignoring memory stalls.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923209A cache has a measured miss rate of 5.00\% with 32-byte blocks.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923210A byte-addressable processor uses 40-bit physical addresses.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923211A byte-addressable processor uses 32-bit virtual addresses and 28-bit physical addresses.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923212Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923213Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923214Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923215Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923216Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923217Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923218Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923219Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923220A processor performs virtual-to-physical translation with a single-level page table that resides in main memory…

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923221A processor uses a single-level page table in main memory and a TLB.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923222A machine has a TLB and a two-level page table.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923223A PTE contains five flags V, R, W, X, and U, and a PPN.

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

ARCH:9923224Mathematical problem title

IO ConcurrencyComputer Architecture Problem Solving

I/O, interrupts, and concurrencyComputer Architecture · Calculation

—

Showing 24 of 50 matching problems.

Private labels

Edit private labels

Add labels that only you can see.

Problem

Current labels

Private labels are unavailable. Close this editor and try again.

New label

Use a short label.

A direct-mapped cache of 32 KiB with 32-byte blocks is measured on a workload of

1.00\times

10^{9}

data references…

A workload touches exactly 5000 distinct 64-byte blocks and issues

2.00\times

10^{6}

data references.

A processor has a clock rate of

2.00\,\mathrm{GHz}

.

Define

\mathrm{AMAT}=\mathrm{HitTime}+\mathrm{MissRate}\times\mathrm{MissPenalty}

, where HitTime and MissPenalty…

A byte-addressable ISA uses 48-bit virtual addresses, 36-bit physical addresses, and

2^{13}-byte

(8 KiB) pages.

A byte-addressable machine has 32-bit virtual addresses, 32-bit physical addresses, and

2^{12}-byte

pages.

A byte-addressable system uses 16-bit virtual addresses, 16-bit physical addresses, and

2^8-byte

pages.

A byte-addressable machine uses 32-bit virtual addresses and

2^{12}-byte

pages.

A byte-addressable machine uses 32-bit virtual addresses, 32-bit physical addresses, and

2.00\,\mathrm{GHz}

pages.

A byte-addressable machine uses 32-bit virtual addresses,

2^{12}-byte

pages, and 4-byte PTEs.

A byte-addressable processor uses 32-bit virtual addresses, 32-bit physical addresses, and

2^{12}-byte

pages.

A byte-addressable machine uses 32-bit virtual addresses, 32-bit physical addresses, and

2^{12}-byte

pages.

A byte-addressable system uses 16-bit virtual addresses and

2^8-byte

pages.