Source note2 min read
ArchAgent v2: A Case Study with the Data Prefetching Championship
Source
arXiv
arxiv.org/abs/2608.09874v1
Source
- Source name: arXiv
- Source kind: paper
- Authors / organization: Abraham Gonzalez, Raghav Gupta, Akanksha Jain, Hanna Alam, Alexander Novikov, Po-Sen Huang, Matej Balog, Marvin Eisenberger, Sergey Shirobokov, Ngân Vũ, Hank Levy, Borivoje Nikolić, Sagar Karandikar, Martin Dixon, Parthasarathy Ranganathan
- Venue: arXiv: cs.AI
- Published: 2026-08-10
- Collected: 2026-08-11
- URL: http://arxiv.org/abs/2608.09874v1
- PDF: https://arxiv.org/pdf/2608.09874v1
- DOI: UNKNOWN
- Registry group: academic_apis_and_preprints
- Evidence role: canonical_academic_index
- Language: en
- Country / region: UNKNOWN
Plain-Language Brief
The paper presents ArchAgent v2, a framework that scales automated microarchitecture search to multi-level data prefetching. It outperforms the winning hand-designed solution in the 4th Data Prefetching Championship, achieving a 3.8% geometric mean IPC speedup over the baseline and a 0.3% improvement over the prior champion, BertiGO.
What the Document Says
- The work introduces ArchAgent v2, a framework for automated microarchitecture search in multi-level data prefetching.
- ArchAgent v2 outperformed the winning hand-designed solution in the 4th Data Prefetching Championship.
- It achieved a 3.8% geometric mean IPC speedup over the baseline and a 0.3% improvement over BertiGO, the prior champion.
Key Concepts Mentioned
- Artificial Intelligence
- Agentic AI
- Automated Algorithm Design
- Computer Microarchitecture Discovery
- Data Prefetching Championship
- ArchAgent v2
- Three-level prefetcher
Claims Made by the Document
- ArchAgent v2 automatically designs a three-level prefetcher that outperforms the winning hand-designed solution.
- The discovered policy achieves a 3.8% geometric mean IPC speedup over the baseline.
Evidence Used
- It was evaluated under identical rules of the 4th Data Prefetching Championship (DPC4)
Methods / Approach
UNKNOWN
Limitations Stated by the Authors
UNKNOWN
Limitations Noted by the Agent
Agent interpretation — not from the source.
UNKNOWN
Open Questions
UNKNOWN
Notes for Future Q&A
May include interpretation. Labeled where it does.
UNKNOWN
Raw Abstract / Excerpt
Agentic artificial intelligence has shown great promise in automating algorithm design, but scaling similar techniques to computer microarchitecture discovery remains challenging due to vast search spaces, strict hardware budgets, and long simulation times. In this work, we present ArchAgent v2, a framework which scales automated microarchitecture search to multi-level data prefetching. While the original ArchAgent successfully discovered single-level cache replacement policies in competition settings, it does not scale to multi-level prefetching where the design space and degrees of freedom are larger. To overcome this, we introduce two new additions to ArchAgent: a cascaded evolutionary search that subdivides the design space by sequentially evolving and freezing prefetchers at individual cache levels, and a hardware-realizability feedback loop that embeds real-time size-estimation directly into the evolution process. Evaluated under identical rules of the 4th Data Prefetching Championship (DPC4), ArchAgent v2 automatically designs a three-level prefetcher that outperforms the winning hand-designed solution, further demonstrating automated agentic discovery as a useful tool for computer architects. Our discovered policy achieves a 3.8% geometric mean IPC speedup over the baseline overall and a 0.3% improvement over the prior champion, BertiGO. On low-bandwidth single-core configurations, our policy yields a 4.6% performance speedup compared to only 2.6% for BertiGO. However, multi-core evolution still remains a significant challenge due to simulation latency impeding evolution speed. Finally, our profiling of an ArchAgent evolution of over 12,000 candidate designs provides key insights into how automated evolutionary agents explore and synthesize complex microarchitectural logic.
