Skip to content
DenseChip
Learn
PracticeCode labInterview

DenseChip

Navigate

Menu

LearnPracticeCode labInterview

Tools

All toolsSV editorCode repoResume
DenseChip

Practice, courses, and chip-design tools in one focused workspace.

LearnPracticeCode labInterviewToolsLearning paths

© 2026 DenseChip

AboutContactPrivacyTerms
Skip to lesson

Course contents

  • Architecture Metrics Reference
  • Workload Taxonomy for Architects
  • Architecture Glossary
  • Computer Architecture Cheatsheet
  • Pipeline Fundamentals14
  • Memory Hierarchy15
  • NoC and Interconnect Architecture6
  • Coherency and Memory Ordering9
  • Performance Analysis9
  • Accelerator Architectures6
  • SoC Architecture Tradeoffs9
  • Architecture Interview Prep14
Loading lesson

‹Computer Architecture
  1. Topics
  2. Computer Architecture
  3. Architecture Metrics Reference

Computer Architecture · All levels

Architecture Metrics Reference

CPI, AMAT, MPKI, Little's law, roofline, and power: each formula with a worked numeric example.

On this page

    Each entry states its assumptions and units. Every number below divides evenly by hand.

    CPI and IPC

    CPI is cycles per instruction and IPC is its inverse. Both describe one named workload, never a core in the abstract.

    Diagram
    A core retires 3 instructions every 2 cycles.
    IPC = 3 instr / 2 cycles = 1.5 instr/cycle
    CPI = 1 / IPC = 1 / 1.5 = 0.67 cycles/instr

    Common pitfall

    Quoting IPC without the workload. The same core reports a different IPC on branchy code and on streaming code.

    Speedup and Amdahl's law

    Speedup is bounded by the fraction that does not improve. P is the share of runtime that speeds up by S.

    Diagram
    P = 0.60 of runtime speeds up by S = 4.
    Speedup = 1 / ((1 - 0.60) + 0.60 / 4)
            = 1 / (0.40 + 0.15)
            = 1 / 0.55 = 1.82

    Common pitfall

    Applying Amdahl to the whole program when only one kernel speeds up. Measure P on the full runtime first.

    AMAT

    Average memory access time adds hit time to miss rate times miss penalty. Use the miss rate as a fraction, not a percent.

    Diagram
    Hit time 1 cycle, miss rate 5%, miss penalty 100 cycles.
    AMAT = 1 + 0.05 x 100 = 1 + 5 = 6 cycles

    Common pitfall

    Plugging in 5 instead of 0.05. That unit slip reports 501 cycles instead of 6.

    MPKI and its CPI contribution

    MPKI is misses per thousand instructions at one cache level. Each miss costs its penalty in stalled cycles.

    Diagram
    MPKI 10 at the LLC, miss penalty 100 cycles.
    Misses per instr = 10 / 1000 = 0.01
    CPI addition = 0.01 x 100 = 1.0 cycle/instr

    Common pitfall

    Comparing MPKI across cache levels or workloads as if the denominator matched. State the level and the workload.

    Little's law

    Concurrency equals throughput times latency. It sizes queues, MSHRs, and outstanding requests.

    Diagram
    A link moves 64-byte lines at 10 GB/s, average latency 100 ns.
    Lines per second = 10e9 / 64 = 156,250,000
    Outstanding = 156,250,000 x 100e-9 = 15.625
    So about 16 outstanding lines hide the latency.

    Common pitfall

    Using average latency for SLO-shaped traffic. Tails need the high-percentile latency, not the mean.

    Bandwidth and arithmetic intensity

    Arithmetic intensity is operations per byte moved from memory. It converts a bandwidth limit into a compute ceiling.

    Diagram
    A kernel does 1 FLOP per 4 bytes moved.
    Intensity = 1 / 4 = 0.25 FLOP/byte
    Ceiling at 100 GB/s = 100e9 x 0.25 = 25 GFLOP/s

    Common pitfall

    Quoting peak link bandwidth as delivered bandwidth. Row-buffer hits, read-write turnaround, and contention lower it.

    Roofline bound

    Sustained performance stays under both the compute peak and the bandwidth times intensity product. The lower roof binds.

    Diagram
    Peak 1000 GFLOP/s, bandwidth 200 GB/s, intensity 2 FLOP/byte.
    Memory ceiling = 200 x 2 = 400 GFLOP/s
    Perf <= min(1000, 400) = 400 GFLOP/s, memory bound

    Common pitfall

    Placing a kernel without stating which bytes the intensity counts. LLC bytes and DRAM bytes give different points.

    Dynamic power

    Switching power scales with capacitance, the square of voltage, and frequency. Voltage moves the result fastest.

    Diagram
    C = 2 nF, V = 0.8 V, f = 2 GHz.
    P = C x V^2 x f = 2e-9 x 0.64 x 2e9
      = 2 x 0.64 x 2 = 2.56 W

    Common pitfall

    Treating dynamic power as total power. Leakage adds on top, and it grows with temperature.

    Related topics

    • Course Hub

    • Workload Taxonomy

    • Cheatsheet

    • Performance Method

    • Roofline and Tuning

    Previous

    1 / 86

    Next: Workload Taxonomy for Architects

    Up next

    Up nextWorkload Taxonomy for Architects

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • Architecture Glossary
    • Computer Architecture Cheatsheet
    • Pipeline Fundamentals