Instruction-set interface
Define the operations, registers and memory model exposed to software independently of one microarchitecture.
Subject
Purpose
Computing hardware studied through instruction sets, processors, memory hierarchies, parallelism and the trade-offs connecting software to physical execution.
Structure
Components → constraints → flows → control → failure
Computer architecture explains performance by connecting abstractions visible to software with pipelines, caches, memory and parallel execution underneath.
Define the operations, registers and memory model exposed to software independently of one microarchitecture.
Trace instruction fetch, decode, execution and retirement through processor structures.
Increase throughput by overlapping work while managing hazards, branches and recovery from wrong predictions.
Use caches and locality to bridge the speed gap between processors and larger memory systems.
Study multicore, vector and accelerator architectures while separating peak throughput from realized application performance.
ISA ≠ microarchitecture
clock speed ≠ performance
cache hit rate ≠ application speed
Which bottleneck dominates a workload: compute, latency, bandwidth or synchronization?
How does speculation trade efficiency for complexity and energy?
When does hardware specialization justify reduced generality?
Benchmark representative workloads, report energy and memory behavior, and separate synthetic microbenchmarks from end-to-end performance.