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
    • Performance Method: Counters, Top-Down and Triage
      • What a PMU Counts
      • CPI, IPC, MPKI and Derived Metrics
      • Multiplexing, Denominators and Trust
      • Top-Down Bottleneck Attribution
      • Freeze the Workload, One Experiment, Replay
    • Roofline and Tuning
  • Accelerator Architectures6
  • SoC Architecture Tradeoffs9
  • Architecture Interview Prep14
Loading lesson

‹Performance Method: Counters, Top-Down and Triage
  1. Topics
  2. Computer Architecture
  3. Performance Analysis
  4. Performance Method: Counters, Top-Down and Triage
  5. Multiplexing, Denominators and Trust

Computer Architecture · All levels

Multiplexing, Denominators and Trust

Multiplex scaling, denominator discipline, and repeatability checks that make counters trustworthy.

On this page

    The scaling rule

    Few cores have one counter per event, so events time-share the programmable counters. Each event counts only while it is scheduled, denoted time_enabled, within the whole run time_total.

    The scaled estimate is scaled = raw x (time_total / time_enabled). Assume a raw count of 1.2M gathered over 2 ms inside a 10 ms run.

    Diagram
    scaled = 1.2e6 x (10 ms / 2 ms)
           = 1.2e6 x 5
           = 6.0e6 events

    Scaling assumes the event rate was steady across the run. Bursty events break that assumption, so bursty counts need a dedicated counter and a replay.

    Denominator discipline

    Every ratio needs a stated denominator with matching window and scope. A count without a denominator is a rumor, not evidence.

    Trap

    Example

    Fix

    Mixed denominators

    Events per micro-op beside events per cycle

    Convert to one denominator before comparing

    Scope mismatch

    Per-core misses over system-wide cycles

    Use core cycles for core events

    Window mismatch

    Counts from a warmup window beside steady-state cycles

    Lock one window for numerator and denominator

    Event aliasing

    Two names for one underlying event summed twice

    Read the event list once and de-duplicate

    Repeatability and golden checks

    Lock the workload revision, the run window, and the frequency state before comparing two runs. Traces from different thermal or frequency envelopes never compare.

    Calibrate against small golden microbenchmarks with known answers, such as a loop with a known trip count. A counter that fails a golden check leaves the run, not the conclusion.

    1. Repeat the run and require the key ratios to agree within a stated band.

    2. Cross-check one counter claim against a second independent source.

    3. Drop counters that fail consistency checks under controlled replay.

    Common pitfall

    Treating one noisy run as architecture truth sends teams toward expensive but irrelevant fixes. No single run decides anything: repeat, cross-check, then conclude.

    Interview

    Likely probes: the trust sequence for an unfamiliar counter.

    • State the scaling factor and the denominator before the value.

    • Name the aliasing and overflow checks already performed.

    • Cite the golden microbenchmark the path was calibrated against.

    Check yourself An event counts 1.2M while enabled for 2 ms of a 10 ms run. What is the scaled estimate?

    6.0M events. The calc block shows 1.2M x (10 / 2) = 6.0M, valid only if the rate was steady.

    Check yourself A ratio divides per-core miss counts by system-wide cycles. What is wrong?

    Scope mismatch. Core events need core cycles, so either scope both to the core or both to the system.

    Previous

    51 / 86

    Next: Top-Down Bottleneck Attribution

    Up next

    Up nextTop-Down Bottleneck Attribution

    Sign in to save progress

    Practice this lessonReport an error

    See also

    • What a PMU Counts
    • Freeze the Workload, One Experiment, Replay