期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings
1
作者 Ye Chi Ren-Tong Guo +2 位作者 Xiao-Fei Liao Hai-Kun Liu Jianhui Yue 《Journal of Computer Science & Technology》 CSCD 2024年第6期1341-1360,共20页
Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main memory.To fully realize their potential,it is essential to improve D... Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main memory.To fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit latency.In order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called P3DC.This design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency simultaneously.To address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative structure.We also propose a replacement policy to balance the miss penalty and the temporal locality of different blocks.In addition,P3DC provides a policy to mitigate cache thrashing due to block type variations.Experimental results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8. 展开更多
关键词 die-stacked dynamic random access memory(DRAM) CACHE set-associative direct-mapped hit latency
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部