Practice problems with hints and solutions · ProofAnvil 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
ProblemCourse & topicStatus
MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—MemoryComputer Architecture Problem Solving
Caches, virtual memory, and memory hierarchyComputer Architecture · Calculation
—Showing 24 of 50 matching problems.
A 5-stage in-order pipeline (IF, ID, EX, MEM, WB) issues at most one instruction per cycle, writes the register…
The same 5-stage pipeline as Problem 151 is used, still with no forwarding.
A 5-stage pipeline implements forwarding from the EX/MEM pipeline register and from the MEM/WB pipeline register…
Prove that, in an in-order 5-stage pipeline that writes architectural registers only in WB, WAR and WAW hazards…
A 5-stage pipeline with full ALU forwarding (EX/MEM and MEM/WB) and a load-use hazard detector is given the…
Without forwarding, a load-use pair…
Consider a 5-stage pipeline with forwarding from EX/MEM and MEM/WB into EX, plus internal register-file forwarding…
A hazard-detection unit for a 5-stage pipeline asserts a 1-cycle stall when ``` ID/EX.MemRead = 1 and (ID/EX.Rt…
An ALU forwarding unit compares 5-bit register numbers and never forwards $zero. A compiler emits the MIPS-like fragment…
A 5-stage pipeline without forwarding resolves a RAW hazard by stalling the consumer in ID until the producer has…
Classify each of the following pipeline events as a structural hazard, a data hazard, or a control hazard, and…
A 5-stage pipeline resolves branches in EX, predicts every branch not-taken, and flushes IF and ID on a taken branch.
The pipeline of Problem 163 is modified so that branches resolve in ID rather than EX, still with static not-taken…
A MIPS-style delayed branch has a 1-instruction delay slot that is always executed, whether the branch is taken or…
A compiler must fill a 1-instruction branch delay slot from the original sequence…
In a 5-stage pipeline with a 1-instruction delay slot and branch resolution in ID, the delay-slot instruction is…
A 1-bit branch predictor is indexed by the word address of a 32-bit instruction, uses a 256-entry table of 1-bit…
A 2-bit saturating counter sits in states 00 (strong not-taken), 01 (weak not-taken), 10 (weak taken), 11 (strong…
A dedicated 1-bit predictor for this bne starts at 0 (not-taken).
A 2-bit predictor table has 28 entries, is indexed by bits [9:2] of the 32-bit branch PC, and is initialized to… A pipeline fetches one 32-bit instruction per cycle.
Derive a formula for the control-hazard contribution to CPI of a 5-stage pipeline that resolves branches in stage…
A 5-stage pipeline with full ALU forwarding and a 1-cycle load-use stall executes a mix of 25% loads, 10% stores…