The block-based trace cache
The block-based trace cache
复制标题
基于块的跟踪缓存
DOI：
--
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
John Paul Shen
中科院分区：
文献类型：
--
作者：
B. Black;Bohuslav Rychlik;John Paul Shen
跟踪缓存是最近提出的解决方案，用于通过缓冲和重复使用动态指令轨迹来实现高指令获取带宽。这项工作提出了一种新的基于块的跟踪缓存实现，该实现可以实现更高的IPC性能，并具有更有效的轨迹存储。与其明确存储轨迹的指令，而是将构成痕迹的指针存储在较小的痕迹表中。基于块的跟踪缓存重命名在基本块级别上获取地址，并存储在块缓存中对齐块。通过使用跟踪表中的块指针访问复制的块缓存来构建轨迹。量化了基于区块的痕量缓存的性能潜力，并将其与完美的分支预测和完美的提取方案进行了比较。与传统的跟踪缓存相比，基于块的设计可以实现更高的IPC，对周期时间的影响较小。
The trace cache is a recently proposed solution to achieving high instruction fetch bandwidth by buffering and reusing dynamic instruction traces. This work presents a new block-based trace cache implementation that can achieve higher IPC performance with more efficient storage of traces. Instead of explicitly storing instructions of a trace, pointers to blocks constituting a trace are stored in a much smaller trace table. The block-based trace cache renames fetch addresses at the basic block level and stores aligned blocks in a block cache. Traces are constructed by accessing the replicated block cache using block pointers from the trace table. Performance potential of the blockbased trace cache is quantified and compared with perfect branch prediction and perfect fetch schemes. Comparing to the conventional trace cache, the block-based design can achieve higher IPC, with less impact on cycle time.