A trace-driven analytical model with less profiling overhead for DRAM access latencies

Fengying Sun, Kecheng Ji, Ming Ling, Longxing Shi
{"title":"A trace-driven analytical model with less profiling overhead for DRAM access latencies","authors":"Fengying Sun, Kecheng Ji, Ming Ling, Longxing Shi","doi":"10.1109/PACRIM.2017.8121883","DOIUrl":null,"url":null,"abstract":"Due to the painful time consuming of cycle-accurate simulations, analytical modeling of DRAM systems has been becoming an effective alternative to give guidance for architecture optimizations. Some analytical models forecast the DRAM performance by obtaining the proportions of different DRAM command appearances from memory trace profiling. However, existing works require too many cases composed by different DRAM commands which need lots of profiling and consume much of time. On the flip side, other methods assume that the arrival process of memory requests to the DRAM satisfies the Poisson distribution and estimate the DRAM performance based on the queueing theory. The assumption, however, will be shown not accurate by our experiments in this paper. Not surprisingly, the performance forecasting based on these models is not accurate, not to mention the cases that some researchers assume the DDR access latency as an empirical constant value. Hence, in this paper, we propose a trace-driven analytical model to quickly and precisely estimate the DDR access latency. Compared to prior studies, our model requires much less time overhead without sacrificing the forecasting precision. 17 benchmarks are adopted for the accuracy evaluation of our model. Compared with the simulation results using Gem5 and DRAMSim2, the average accuracy of our model is higher than 93.31%, while the forecasting process can be sped up by x22 times contrast to cycle-accurate simulations.","PeriodicalId":308087,"journal":{"name":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2017.8121883","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Due to the painful time consuming of cycle-accurate simulations, analytical modeling of DRAM systems has been becoming an effective alternative to give guidance for architecture optimizations. Some analytical models forecast the DRAM performance by obtaining the proportions of different DRAM command appearances from memory trace profiling. However, existing works require too many cases composed by different DRAM commands which need lots of profiling and consume much of time. On the flip side, other methods assume that the arrival process of memory requests to the DRAM satisfies the Poisson distribution and estimate the DRAM performance based on the queueing theory. The assumption, however, will be shown not accurate by our experiments in this paper. Not surprisingly, the performance forecasting based on these models is not accurate, not to mention the cases that some researchers assume the DDR access latency as an empirical constant value. Hence, in this paper, we propose a trace-driven analytical model to quickly and precisely estimate the DDR access latency. Compared to prior studies, our model requires much less time overhead without sacrificing the forecasting precision. 17 benchmarks are adopted for the accuracy evaluation of our model. Compared with the simulation results using Gem5 and DRAMSim2, the average accuracy of our model is higher than 93.31%, while the forecasting process can be sped up by x22 times contrast to cycle-accurate simulations.
跟踪驱动的分析模型,具有较少的DRAM访问延迟分析开销
由于周期精确的模拟非常耗时,DRAM系统的分析建模已经成为指导架构优化的有效替代方法。一些分析模型通过从内存跟踪分析中获得不同DRAM命令出现的比例来预测DRAM性能。然而,现有的工作需要太多由不同的DRAM命令组成的案例,需要大量的分析和消耗大量的时间。另一方面,其他方法假设内存请求到达DRAM的过程满足泊松分布,并基于排队理论估计DRAM的性能。然而,本文的实验将证明这种假设是不准确的。不足为奇的是,基于这些模型的性能预测并不准确,更不用说一些研究人员将DDR访问延迟假设为经验常数值。因此,在本文中,我们提出了一个跟踪驱动的分析模型来快速准确地估计DDR访问延迟。与以往的研究相比,我们的模型在不牺牲预测精度的情况下,需要更少的时间开销。我们采用了17个基准来评估模型的准确性。与使用Gem5和DRAMSim2的模拟结果相比,我们的模型的平均精度高于93.31%,与周期精度模拟相比,我们的预测过程可以加快x22倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信