在加载存储队列中缓存值

D. Nicolaescu, A. Veidenbaum, A. Nicolau
{"title":"在加载存储队列中缓存值","authors":"D. Nicolaescu, A. Veidenbaum, A. Nicolau","doi":"10.1109/MASCOT.2004.1348315","DOIUrl":null,"url":null,"abstract":"The latency of an L1 data cache continues to grow with increasing clock frequency, cache size and associativity. The increased latency is an important source of performance loss in high-performance processors. The paper proposes to cache data utilizing the load store queue (LSQ) hardware and data paths. Using very little additional hardware, this inexpensive cache improves performance and reduces energy consumption. The modified load store queue \"caches\" all previously accessed data values going beyond existing store-to-load forwarding techniques. Both load and store data are placed in the LSQ and are retained there after a corresponding memory access instruction has been committed. It is shown that a 128-entry modified LSQ design allows an average of 51% of all loads in the SPECint2000 benchmarks to get their data from the LSQ. Up to 7% performance improvement is achieved on SPECint2000 with a 1-cycle LSQ access latency and 3-cycle L1 cache latency. The average speedup is over 4%.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"25 1","pages":"580-587"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Caching values in the load store queue\",\"authors\":\"D. Nicolaescu, A. Veidenbaum, A. Nicolau\",\"doi\":\"10.1109/MASCOT.2004.1348315\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The latency of an L1 data cache continues to grow with increasing clock frequency, cache size and associativity. The increased latency is an important source of performance loss in high-performance processors. The paper proposes to cache data utilizing the load store queue (LSQ) hardware and data paths. Using very little additional hardware, this inexpensive cache improves performance and reduces energy consumption. The modified load store queue \\\"caches\\\" all previously accessed data values going beyond existing store-to-load forwarding techniques. Both load and store data are placed in the LSQ and are retained there after a corresponding memory access instruction has been committed. It is shown that a 128-entry modified LSQ design allows an average of 51% of all loads in the SPECint2000 benchmarks to get their data from the LSQ. Up to 7% performance improvement is achieved on SPECint2000 with a 1-cycle LSQ access latency and 3-cycle L1 cache latency. The average speedup is over 4%.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"25 1\",\"pages\":\"580-587\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2004.1348315\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2004.1348315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

L1数据缓存的延迟会随着时钟频率、缓存大小和关联性的增加而持续增长。增加的延迟是高性能处理器性能损失的一个重要来源。本文提出利用负载存储队列(LSQ)硬件和数据路径实现数据缓存。使用很少的额外硬件,这种廉价的缓存提高了性能并降低了能耗。修改后的加载存储队列“缓存”了所有以前访问过的数据值,超越了现有的存储到负载转发技术。加载和存储数据都放在LSQ中,并在提交相应的内存访问指令后保留在那里。结果表明,128项修改后的LSQ设计允许SPECint2000基准测试中平均51%的所有负载从LSQ获取数据。SPECint2000在1周期LSQ访问延迟和3周期L1缓存延迟的情况下实现了高达7%的性能改进。平均加速超过4%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Caching values in the load store queue
The latency of an L1 data cache continues to grow with increasing clock frequency, cache size and associativity. The increased latency is an important source of performance loss in high-performance processors. The paper proposes to cache data utilizing the load store queue (LSQ) hardware and data paths. Using very little additional hardware, this inexpensive cache improves performance and reduces energy consumption. The modified load store queue "caches" all previously accessed data values going beyond existing store-to-load forwarding techniques. Both load and store data are placed in the LSQ and are retained there after a corresponding memory access instruction has been committed. It is shown that a 128-entry modified LSQ design allows an average of 51% of all loads in the SPECint2000 benchmarks to get their data from the LSQ. Up to 7% performance improvement is achieved on SPECint2000 with a 1-cycle LSQ access latency and 3-cycle L1 cache latency. The average speedup is over 4%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信