基于度量的工作负载分类的近数据处理性能改进预测

Dimitrios Papalekas, A. Tziouvaras, G. Floros, Georgios Dimitriou, Michael F. Dossis, G. Stamoulis
{"title":"基于度量的工作负载分类的近数据处理性能改进预测","authors":"Dimitrios Papalekas, A. Tziouvaras, G. Floros, Georgios Dimitriou, Michael F. Dossis, G. Stamoulis","doi":"10.1109/mocast54814.2022.9837704","DOIUrl":null,"url":null,"abstract":"Contrary to the improvement of CPU capabilities, traditional DRAM evolution faced significant challenges that render it the main performance bottleneck in contemporary systems. Data-Intensive applications such as Machine Learning and Graph Processing algorithms depend on time and energy consuming transactions between the memory bus and the CPU caches. The emergence of 3D-Stacked memories that provide a very high bandwidth led to the exploration of the Process-In-Memory (PIM) paradigm where logic is added to the memory die and data are being processed where they reside. To fully exploit this model, there is a need to methodically determine the portions of code that are better fitted for Near-Data-Processing (NDP). To this extend, in this work, after presenting the key trends of the research field and examine proposed criteria, we simplify the process of a priori decision of a block’s suitability by proposing a two-step metric-based application categorization able to predict the applications behavior when offloaded for NDP.","PeriodicalId":122414,"journal":{"name":"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Near Data Processing Performance Improvement Prediction via Metric-Based Workload Classification\",\"authors\":\"Dimitrios Papalekas, A. Tziouvaras, G. Floros, Georgios Dimitriou, Michael F. Dossis, G. Stamoulis\",\"doi\":\"10.1109/mocast54814.2022.9837704\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Contrary to the improvement of CPU capabilities, traditional DRAM evolution faced significant challenges that render it the main performance bottleneck in contemporary systems. Data-Intensive applications such as Machine Learning and Graph Processing algorithms depend on time and energy consuming transactions between the memory bus and the CPU caches. The emergence of 3D-Stacked memories that provide a very high bandwidth led to the exploration of the Process-In-Memory (PIM) paradigm where logic is added to the memory die and data are being processed where they reside. To fully exploit this model, there is a need to methodically determine the portions of code that are better fitted for Near-Data-Processing (NDP). To this extend, in this work, after presenting the key trends of the research field and examine proposed criteria, we simplify the process of a priori decision of a block’s suitability by proposing a two-step metric-based application categorization able to predict the applications behavior when offloaded for NDP.\",\"PeriodicalId\":122414,\"journal\":{\"name\":\"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/mocast54814.2022.9837704\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 11th International Conference on Modern Circuits and Systems Technologies (MOCAST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/mocast54814.2022.9837704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

与CPU能力的提高相反,传统DRAM的发展面临着重大挑战,使其成为当代系统中的主要性能瓶颈。数据密集型应用程序,如机器学习和图形处理算法依赖于内存总线和CPU缓存之间的时间和能量消耗事务。提供非常高带宽的3d堆叠存储器的出现导致了对内存中进程(PIM)范式的探索,在这种范式中,逻辑被添加到内存芯片中,数据在它们驻留的地方被处理。为了充分利用这个模型,需要系统地确定代码中更适合近数据处理(NDP)的部分。为此,在本工作中,在介绍了研究领域的关键趋势并检查了提出的标准之后,我们通过提出一种基于度量的两步应用程序分类方法来简化区块适用性的先验决策过程,该方法能够预测卸载NDP时应用程序的行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Near Data Processing Performance Improvement Prediction via Metric-Based Workload Classification
Contrary to the improvement of CPU capabilities, traditional DRAM evolution faced significant challenges that render it the main performance bottleneck in contemporary systems. Data-Intensive applications such as Machine Learning and Graph Processing algorithms depend on time and energy consuming transactions between the memory bus and the CPU caches. The emergence of 3D-Stacked memories that provide a very high bandwidth led to the exploration of the Process-In-Memory (PIM) paradigm where logic is added to the memory die and data are being processed where they reside. To fully exploit this model, there is a need to methodically determine the portions of code that are better fitted for Near-Data-Processing (NDP). To this extend, in this work, after presenting the key trends of the research field and examine proposed criteria, we simplify the process of a priori decision of a block’s suitability by proposing a two-step metric-based application categorization able to predict the applications behavior when offloaded for NDP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信