Pith. sign in

REVIEW 12 cited by

The Championship Simulator: Architectural Simulation for Education and Competition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2210.14324 v1 pith:JPUUXW3O submitted 2022-10-25 cs.AR

classification cs.AR
keywords complexityfieldchampsimcoreincreasemicroarchitecturearchitecturecompetition
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent years have seen a dramatic increase in the microarchitectural complexity of processors. This increase in complexity presents a twofold challenge for the field of computer architecture. First, no individual architect can fully comprehend the complexity of the entire microarchitecture of the core. This leads to increasingly specialized architects, who treat parts of the core outside their particular expertise as black boxes. Second, with increasing complexity, the field becomes decreasingly accessible to new students of the field. When learning core microarchitecture, new students must first learn the big picture of how the system works in order to understand how the pieces all fit together. The tools used to study microarchitecture experience a similar struggle. As with the microarchitectures they simulate, an increase in complexity reduces accessibility to new users. In this work, we present ChampSim. ChampSim uses a modular design and configurable structure to achieve a low barrier to entry into the field of microarchitecural simulation. ChampSim has shown itself to be useful in multiple areas of research, competition, and education. In this way, we seek to promote access and inclusion despite the increasing complexity of the field of computer architecture.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 12 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Beyond Static Policies: Dynamic Selection Among Modern Microarchitectural Policies

    cs.AR 2026-08 conditional novelty 7.0 of 10

    A binary runtime choice between two L1D prefetchers recovers most of the performance left by any fixed policy, with a small decision tree or bandit rule as the selector.

  2. Themis: Software-Defined Hardware Prefetching

    cs.AR 2026-07 conditional novelty 7.0 of 10

    Page-granular, profile-computed prefetch-disable hints stored in page-table entries reduce useless hardware prefetches by ~40% and improve IPC by 0.2–13.8% across seven prefetchers on datacenter traces.

  3. ArchEval: Measuring AI Agents as Computer Architects

    cs.AR 2026-07 conditional novelty 7.0 of 10

    LLM agents beat architecture baselines with full simulator harnesses, but only one configuration stays above baseline without feedback, and performance modeling remains weak.

  4. CHIA: An open-source framework for principled, agentic AI-driven hardware/software co-design research

    cs.AR 2026-06 unverdicted novelty 7.0 of 10

    CHIA is an open-source framework for agentic AI-driven hardware/software co-design using CHIA loops as directed cyclic graphs, a tool library, and features for reliable experimentation, shown via five case studies.

  5. RogueRFM: Attacking Refresh Management for Covert-Channel and Denial-of-Service

    cs.CR 2025-01 conditional novelty 7.0 of 10

    An attacker can abuse DDR5 Refresh Management so one DRAM bank's activity stalls all other banks, creating a 31.3 KB/s covert channel and up to 67% slowdown of co-running workloads.

  6. Dissecting Conditional Branch Predictors of Apple Firestorm and Qualcomm Oryon for Software Optimization and Architectural Analysis

    cs.AR 2024-11 conditional novelty 7.0 of 10

    First known recovery of Apple Firestorm and Qualcomm Oryon conditional branch predictor internals, with identification of two new misprediction-inducing effects and a software mitigation.

  7. PIMID: A Full-System Simulator with Intricacy and Diversity for Processing-in-Memory

    cs.AR 2026-07 conditional novelty 6.5 of 10

    PIMID unifies dual-execution-model, multi-technology, multi-placement PIM simulation and finds technology, PE scaling, and message-passing collectives dominate end-to-end time and energy.

  8. ArchAgent v2: A Case Study with the Data Prefetching Championship

    cs.AI 2026-08 conditional novelty 6.0 of 10

    An LLM-based evolutionary framework automatically discovered a multi-level prefetcher that beats the prior hand-designed DPC4 champion on held-out traces.

  9. Aneto: Predicting System Performance by Exploiting Cross-Workload Regularity

    cs.PF 2026-08 conditional novelty 6.0 of 10

    Aneto predicts a workload's CPI under a new memory system from a single run's CPI, LLC miss rate, and miss penalty, via a cross-workload regression of the blocking factor.

  10. Microflow: Microarchitectural Causal Observability for Deep Cross-Layer Analysis and Optimization

    cs.AR 2026-07 conditional novelty 6.0 of 10

    Microflow builds a typed causal graph from simulator traces so that stalls can be traced across software, pipeline, and resource layers, exposing root causes such as a RAS corruption cascade in leela and cross-loop co...

  11. Vulcan: Instance-specialized, Verifiable Systems Heuristics Through LLM-driven Search

    cs.OS 2025-12 reject novelty 5.0 of 10

    Vulcan finds instance-specific cache and memory-tiering heuristics via LLM-driven evolutionary search, but its evaluation overlaps training traces with test traces and the abstract overstates the body's results.

  12. Random Adaptive Cache Placement Policy

    cs.AR 2025-02 reject novelty 2.0 of 10

    A random eviction plus V-Way hybrid cache reports hit rates on four traces without any baseline comparison.

Pith tools