内存镜像不读取的克隆

Simranjeet Singh, Ankit Bende, Chandan Kumar Jha, Vikas Rana, Rolf Drechsler, Sachin Patkar, Farhad Merchant
{"title":"内存镜像不读取的克隆","authors":"Simranjeet Singh, Ankit Bende, Chandan Kumar Jha, Vikas Rana, Rolf Drechsler, Sachin Patkar, Farhad Merchant","doi":"arxiv-2407.02921","DOIUrl":null,"url":null,"abstract":"In-memory computing (IMC) has gained significant attention recently as it\nattempts to reduce the impact of memory bottlenecks. Numerous schemes for\ndigital IMC are presented in the literature, focusing on logic operations.\nOften, an application's description has data dependencies that must be\nresolved. Contemporary IMC architectures perform read followed by write\noperations for this purpose, which results in performance and energy penalties.\nTo solve this fundamental problem, this paper presents in-memory mirroring\n(IMM). IMM eliminates the need for read and write-back steps, thus avoiding\nenergy and performance penalties. Instead, we perform data movement within\nmemory, involving row-wise and column-wise data transfers. Additionally, the\nIMM scheme enables parallel cloning of entire row (word) with a complexity of\n$\\mathcal{O}(1)$. Moreover, our analysis of the energy consumption of the\nproposed technique using resistive random-access memory crossbar and\nexperimentally validated JART VCM v1b model. The IMM increases energy\nefficiency and shows 2$\\times$ performance improvement compared to conventional\ndata movement methods.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"In-Memory Mirroring: Cloning Without Reading\",\"authors\":\"Simranjeet Singh, Ankit Bende, Chandan Kumar Jha, Vikas Rana, Rolf Drechsler, Sachin Patkar, Farhad Merchant\",\"doi\":\"arxiv-2407.02921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In-memory computing (IMC) has gained significant attention recently as it\\nattempts to reduce the impact of memory bottlenecks. Numerous schemes for\\ndigital IMC are presented in the literature, focusing on logic operations.\\nOften, an application's description has data dependencies that must be\\nresolved. Contemporary IMC architectures perform read followed by write\\noperations for this purpose, which results in performance and energy penalties.\\nTo solve this fundamental problem, this paper presents in-memory mirroring\\n(IMM). IMM eliminates the need for read and write-back steps, thus avoiding\\nenergy and performance penalties. Instead, we perform data movement within\\nmemory, involving row-wise and column-wise data transfers. Additionally, the\\nIMM scheme enables parallel cloning of entire row (word) with a complexity of\\n$\\\\mathcal{O}(1)$. Moreover, our analysis of the energy consumption of the\\nproposed technique using resistive random-access memory crossbar and\\nexperimentally validated JART VCM v1b model. The IMM increases energy\\nefficiency and shows 2$\\\\times$ performance improvement compared to conventional\\ndata movement methods.\",\"PeriodicalId\":501168,\"journal\":{\"name\":\"arXiv - CS - Emerging Technologies\",\"volume\":\"24 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Emerging Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.02921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Emerging Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.02921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近,内存计算(IMC)受到了广泛关注,因为它试图减少内存瓶颈的影响。文献中介绍了大量数字 IMC 方案,主要集中在逻辑运算方面。为了解决这一根本问题,本文提出了内存镜像(IMM)方案。为了解决这一根本问题,本文提出了内存内镜像(IMM)技术。IMM 消除了读取和回写步骤,从而避免了能耗和性能损失。取而代之的是,我们在内存中执行数据移动,包括行向和列向数据传输。此外,IMM 方案实现了整行(字)的并行克隆,复杂度为 $/mathcal{O}(1)$。此外,我们还利用电阻式随机存取存储器交叉条和经过实验验证的 JART VCM v1b 模型分析了所提技术的能耗。与传统的数据移动方法相比,IMM 提高了能效,并将性能提高了 2 倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
In-Memory Mirroring: Cloning Without Reading
In-memory computing (IMC) has gained significant attention recently as it attempts to reduce the impact of memory bottlenecks. Numerous schemes for digital IMC are presented in the literature, focusing on logic operations. Often, an application's description has data dependencies that must be resolved. Contemporary IMC architectures perform read followed by write operations for this purpose, which results in performance and energy penalties. To solve this fundamental problem, this paper presents in-memory mirroring (IMM). IMM eliminates the need for read and write-back steps, thus avoiding energy and performance penalties. Instead, we perform data movement within memory, involving row-wise and column-wise data transfers. Additionally, the IMM scheme enables parallel cloning of entire row (word) with a complexity of $\mathcal{O}(1)$. Moreover, our analysis of the energy consumption of the proposed technique using resistive random-access memory crossbar and experimentally validated JART VCM v1b model. The IMM increases energy efficiency and shows 2$\times$ performance improvement compared to conventional data movement methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信