Data-Driven Offline Optimization for Architecting Hardware Accelerators
Aviral Kumar, Amir Yazdanbakhsh, Milad Hashemi, Kevin Swersky, Sergey Levine
摘要
Industry has gradually moved towards application-specific hardware accelerators in order to attain higher efficiency. While such a paradigm shift is already starting to show promising results, designers need to spend considerable manual effort and perform a large number of time-consuming simulations to find accelerators that can accelerate multiple target applications while obeying design constraints. Moreover, such a"simulation-driven"approach must be re-run from scratch every time the set of target applications or design constraints change. An alternative paradigm is to use a"data-driven", offline approach that utilizes logged simulation data, to architect hardware accelerators, without needing any form of simulations. Such an approach not only alleviates the need to run time-consuming simulation, but also enables data reuse and applies even when set of target applications changes. In this paper, we develop such a data-driven offline optimization method for designing hardware accelerators, dubbed PRIME, that enjoys all of these properties. Our approach learns a conservative, robust estimate of the desired cost function, utilizes infeasible points, and optimizes the design against this estimate without any additional simulator queries during optimization. PRIME architects accelerators -- tailored towards both single and multiple applications -- improving performance upon state-of-the-art simulation-driven methods by about 1.54x and 1.20x, while considerably reducing the required total simulation time by 93% and 99%, respectively. In addition, PRIME also architects effective accelerators for unseen applications in a zero-shot setting, outperforming simulation-based methods by 1.26x.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper17
- Learning Performance-Improving Code EditsAlexander Shypula, Aman Madaan, Yimeng Zeng, Uri Alon 等ICLR 2024 · 被引用 141 次
- FLAT: An Optimized Dataflow for Mitigating Attention BottlenecksSheng-Chun Kao, Suvinay Subramanian, Gaurav Agrawal, Amir Yazdanbakhsh 等ASPLOS 2023 · 被引用 68 次
- Unsupervised Learning for Combinatorial Optimization with Principled Objective RelaxationHaoyu Wang, Nan Wu, Hang Yang, Cong Hao 等NeurIPS 2022 · 被引用 54 次
- Data-Driven Offline Decision-Making via Invariant Representation LearningHan Qi, Yi Su, Aviral Kumar, Sergey LevineNeurIPS 2022 · 被引用 43 次
- Forecasting GPU Performance for Deep Learning Training and InferenceSeonho Lee, Amar Phanishayee, Divya MahajanASPLOS 2025 · 被引用 31 次
它引用的顶会 Paper11
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah 等NeurIPS 2020 · 被引用 64,255 次
- Searching for MobileNetV3Andrew Howard, Ruoming Pang, Hartwig Adam, Quoc V. Le 等ICCV 2019 · 被引用 9,163 次
- Conservative Q-Learning for Offline Reinforcement LearningAviral Kumar, Aurick Zhou, George Tucker, Sergey LevineNeurIPS 2020 · 被引用 2,881 次
- Model-based reinforcement learning for biological sequence designChristof Angermüller, David Dohan, David Belanger, Ramya Deshpande 等ICLR 2020 · 被引用 159 次
- Population-Based Black-Box Optimization for Biological Sequence DesignChristof Angermüller, David Belanger, Andreea Gane, Zelda Mariet 等ICML 2020 · 被引用 142 次
相关 Paper
- DSAGEN: Synthesizing Programmable Spatial AcceleratorsJian Weng, Sihao Liu, Vidushi Dadu, Zhengrong Wang 等ISCA 2020 · 被引用 140 次
- Efficiently Exploiting Low Activity Factors to Accelerate RTL SimulationScott Beamer, David DonofrioDAC 2020 · 被引用 36 次
- Compiler-Driven Simulation of Reconfigurable Hardware AcceleratorsZhijing Li, Yuwei Ye, Stephen Neuendorffer, Adrian SampsonHPCA 2022 · 被引用 4 次
- PriMax: maximizing DSL application performance with selective primitive accelerationNicholas Wendt, Todd M. Austin, Valeria BertaccoDAC 2022 · 被引用 2 次
- ORIANNA: An Accelerator Generation Framework for Optimization-based Robotic ApplicationsYuhui Hao, Yiming Gan, Bo Yu, Qiang Liu 等ASPLOS 2024 · 被引用 22 次
