A General Cache Framework for Efficient Generation of Timing Critical Paths
A General Cache Framework for Efficient Generation of Timing Critical Paths
复制标题
用于高效生成时序关键路径的通用缓存框架
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Tsung
中科院分区：
文献类型：
--
作者：
Kuan;Tsung;Tsung
最近的TAU 2018竞赛正在寻求有效生成时序报告的新颖想法。当时序图被更新时，用户查询随后和顺序发生的不同形式的时序报告。该过程在计算上是昂贵的并且固有地复杂。因此，我们在本文中介绍了一个通用的高速缓存框架，有效地产生的时间关键路径。我们的框架有效地支持（1）缓存方案，以最大限度地减少重复计算，（2）图收缩，以减少搜索空间，和（3）多线程。我们在TAU 2018竞赛基准上评估了我们的框架，并展示了优于顶级表现者的良好表现。ACM参考格式：Kuan-Ming Lai，Tsung-Wei Huang and Tsung-Yi Ho. 2019.一种通用的时间关键路径生成Cache框架。在第56届年度设计自动化会议2019（DAC '19），2019年6月2日至6日，拉斯维加斯，内华达州，美国。ACM，美国纽约州纽约，6页。https://doi.org/10.1145/3316781.3317744
The recent TAU 2018 contest was seeking novel idea for efficient generation of timing reports. When the timing graph is updated, users query different forms of timing reports that happen subsequently and sequentially. This process is computationally expensive and inherently complex. Therefore, we introduce in this paper a general cache framework for efficient generation of timing critical paths. Our framework efficiently supports (1) a cache scheme to minimize duplicate calculation, (2) graph contraction to reduce the search space, and (3) multi-threading. We evaluated our framework on the TAU 2018 contest benchmarks and demonstrated promising performance over the top performer.ACM Reference Format:Kuan-Ming Lai, Tsung-Wei Huang and Tsung-Yi Ho. 2019. A General Cache Framework for Efficient Generation of Timing Critical Paths. In The 56th Annual Design Automation Conference 2019 (DAC ’19), June 2–6, 2019, Las Vegas, NV, USA. ACM, New York, NY, USA, 6 pages. https://doi.org/10.1145/3316781.3317744