SEARCH LAVACS

Find a topic across LavaCS

Search textbooks, study guides, six encyclopedias, experiments and comparisons.

33 results · page 1 of 2

Computer Architecture · Comparisons and explanations

Interrupts versus polling

Compare event notification with active checking, including idle CPU cost, observation delay, burst handling and hybrid network processing.

Intermediate

Computer Architecture · Concepts and theorems

TLBs: caching address translations

Separate translation-cache misses, page-table walks, and page faults, and reason about translation reach.

Intermediate

Computer Architecture · Observation and diagnostics

Measuring execution with perf stat

Interpret instructions, cycles, context switches, and faults alongside elapsed time when comparing Linux workloads.

Intermediate

Computer Architecture · Experiments and implementations

Measure arithmetic work and nominal traffic

Change arithmetic per element while preserving nominal reads and writes, then align operation counts, generated instructions and all timing samples.

Intermediate

Computer Architecture · Experiments and implementations

Observe input order and conditional branches

Compare three equally balanced input orders in C, verify the intended conditional jump, and record timings separately from unavailable PMU events.

Intermediate

Computer Architecture · Experiments and implementations

Compare starting alignment with valid C accesses

Traverse equal valid typed ranges from two starting offsets, separating type alignment, line span and individual memory accesses.

Intermediate

Computer Architecture · Experiments and implementations

Examine cancellation and input rounding

Compare a cancellation-prone expression and its reformulation against a high-precision reference, separating arithmetic error from lost input information.

Intermediate

Computer Architecture · Experiments and implementations

Compare row and column traversal order

Traverse the same contiguous matrix in two orders, verify equal results and work, and compare native timings without inventing cache counts.

Intermediate

Computer Architecture · Experiments and implementations

Inspect SIMD instructions and loop tails

Build one C loop with and without vectorization, then align diagnostics, disassembly and complete outputs including the tail.

Intermediate

Computer Architecture · Experiments and implementations

Compare stride, visit count and traversal time

Measure two allocation sizes and four strides in C, normalize unequal work, and keep useful bytes distinct from cache and translation traffic.

Intermediate

Computer Architecture · Experiments and implementations

Separate first and repeated timing observations

Save first, repeated and empty timing intervals, recompute medians from raw samples, and distinguish observations from unverified causes.

Intermediate

Computer Architecture · Study guides

Branch prediction and misprediction cost

Compare equally balanced outcome sequences, calculate an illustrative cost model, and separate generated instructions, timing and hardware counters.

Intermediate

Computer Architecture · Study guides

Trace cache placement from addresses

Decompose byte addresses in a four-set model, trace replacement, and distinguish mapping predictions from measurements of real hardware.

Intermediate