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
Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Parallel PerformanceComputer Architecture Problem Solving
Parallel architecture and performance limitsComputer Architecture · Mixed review
—Showing 24 of 50 matching problems.
A speculative Tomasulo processor has 8 ROB entries, 3 FP-add reservation stations, 2 FP-mul reservation stations…
Consider a scoreboarded processor with a single unpipelined FP multiplier (latency 6) and two unpipelined FP…
A reservation-station data path uses 4-bit tags, 64-bit data, and the following CDB packet format: bit 68 = Valid,…
Let P be a pipeline that issues at most w instructions per cycle, has r reservation stations in total (shared…
A 32-bit PC selects a (1,2) correlating predictor as follows.
A speculative load/store pipeline keeps a ROB of 6 entries and a store buffer of 3 entries.
Prove the following statement, or provide a counterexample instruction sequence that refutes it.
An (m,n) correlating predictor uses an m-bit GHR and a PHT of 2m tables, each table having 2k entries of n-bit… A Tomasulo machine with ROB uses the following 4-bit RS tags and 3-bit ROB indices.
A 2-bit saturating counter in isolation (no GHR) is used to predict a single branch.
A scoreboard maintains, for each of 16 FP registers, a 1-bit Result-pending flag and a 3-bit FU-id naming the…
A processor recovers from a branch misprediction by rolling the ROB Tail back to the entry after the branch and…
The following loop is executed on a speculative Tomasulo machine with a 16-entry ROB, 4 FP-add RS, 3 FP-mul RS, 2…
A global 4-bit GHR and a 16-entry table of 2-bit saturating counters, indexed only by the GHR, implement a (4,2)…
Consider Tomasulo without speculation (no ROB; results write the architectural FP register file from the CDB).
A pipeline records a 2-bit GHR in the fetch stage for prediction, but updates that same architectural GHR only at…
An 8-entry ROB, issue width 1, commit width 1, is used with in-order commit.
Classify each of the following designs as implementing (S) scoreboarding without renaming, (T) Tomasulo without…
A (0,2) predictor is a bimodal 2-bit saturating-counter table of 256 entries indexed by PC[9:2], with no GHR (m=0).
Let Q be a speculative Tomasulo processor with in-order commit through a ROB that implements precise exceptions…
A 32-bit byte-addressable multiprocessor uses write-back, write-allocate, snooping MSI coherence on a shared bus.
The same 32-byte-block write-back caches as in a standard MESI snooping protocol (states M, E, S, I) are used by…
Two processors share a 32-bit word X initialized to 0 and a 32-bit word Y initialized to 0.
A dual-core processor has 64-byte cache lines and a write-back, write-allocate, MESI L1 in each core.