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.
IntermediateSEARCH LAVACS
Search textbooks, study guides, six encyclopedias, experiments and comparisons.
33 results · page 1 of 2
Computer Architecture · Comparisons and explanations
Compare event notification with active checking, including idle CPU cost, observation delay, burst handling and hybrid network processing.
IntermediateComputer Architecture · Concepts and theorems
Separate prediction, speculation and retirement when reasoning about branch costs and optimizations.
IntermediateComputer Architecture · Concepts and theorems
Distinguish coordination of cached copies of one location from ordering constraints across different locations.
IntermediateComputer Architecture · Concepts and theorems
Separate a numeric value from its byte representation when reading memory, packets, and binary formats.
IntermediateComputer Architecture · Concepts and theorems
Use neighbouring counters to distinguish logical sharing from cache-line ownership traffic.
IntermediateComputer Architecture · Concepts and theorems
Separate instruction count, cycle count and frequency when explaining application performance.
IntermediateComputer Architecture · Concepts and theorems
Distinguish reuse of the same data from access to nearby data, and predict when a cache can help.
IntermediateComputer Architecture · Concepts and theorems
Use four-byte alignment to distinguish address requirements, padding, and architecture-dependent unaligned access behavior.
IntermediateComputer Architecture · Concepts and theorems
Separate atomic access from ordering and analyse publication using a data-and-flag example.
IntermediateComputer Architecture · Concepts and theorems
Understand restricted instructions, controlled trap entry, and why a privilege transition is not necessarily a process switch.
IntermediateComputer Architecture · Concepts and theorems
Count vector width, element width and tail work without assuming that wider vectors guarantee proportional speedup.
IntermediateComputer Architecture · Concepts and theorems
Separate translation-cache misses, page-table walks, and page faults, and reason about translation reach.
IntermediateComputer Architecture · Observation and diagnostics
Interpret instructions, cycles, context switches, and faults alongside elapsed time when comparing Linux workloads.
IntermediateComputer Architecture · Experiments and implementations
Change arithmetic per element while preserving nominal reads and writes, then align operation counts, generated instructions and all timing samples.
IntermediateComputer Architecture · Experiments and implementations
Compare three equally balanced input orders in C, verify the intended conditional jump, and record timings separately from unavailable PMU events.
IntermediateComputer Architecture · Experiments and implementations
Traverse equal valid typed ranges from two starting offsets, separating type alignment, line span and individual memory accesses.
IntermediateComputer Architecture · Experiments and implementations
Compare a cancellation-prone expression and its reformulation against a high-precision reference, separating arithmetic error from lost input information.
IntermediateComputer Architecture · Experiments and implementations
Traverse the same contiguous matrix in two orders, verify equal results and work, and compare native timings without inventing cache counts.
IntermediateComputer Architecture · Experiments and implementations
Build one C loop with and without vectorization, then align diagnostics, disassembly and complete outputs including the tail.
IntermediateComputer Architecture · Experiments and implementations
Measure two allocation sizes and four strides in C, normalize unequal work, and keep useful bytes distinct from cache and translation traffic.
IntermediateComputer Architecture · Experiments and implementations
Save first, repeated and empty timing intervals, recompute medians from raw samples, and distinguish observations from unverified causes.
IntermediateComputer Architecture · Study guides
Compare equally balanced outcome sequences, calculate an illustrative cost model, and separate generated instructions, timing and hardware counters.
IntermediateComputer Architecture · Study guides
Decompose byte addresses in a four-set model, trace replacement, and distinguish mapping predictions from measurements of real hardware.
IntermediateComputer Architecture · Study guides
Separate initialization, CPU affinity, and memory policy before evaluating a placement change under controlled workload conditions.
Intermediate