利用布隆滤波器节省自动记忆处理器的功耗

Masayoshi Fujii, Yuuki Sato, Tomoaki Tsumura, Y. Nakashima
{"title":"利用布隆滤波器节省自动记忆处理器的功耗","authors":"Masayoshi Fujii, Yuuki Sato, Tomoaki Tsumura, Y. Nakashima","doi":"10.1109/CANDAR.2016.0069","DOIUrl":null,"url":null,"abstract":"We have proposed a processor which can exploit valuelocalityinprogramsbyautomaticallyapplyingcomputation reuse. The processor which we call auto-memoization processor dynamically detects functions and loop iterations as reusable blocks, and stores their input sequences and results into a lookup table. When the current input sequence matches one of the stored input sequences on the table, the stored result associated with the matched input sequence is written back to the registers and caches. In the previous implementation, a part of the table is implemented with a CAM for achieving associative search for input matching with small overhead. However, CAMs consumeconsiderablylargeenergy, areaandmanufacturingcost. Therefore, CAM size should be as small as possible for improving practicality of the auto-memoization processor. In this paper, we propose a low-power implementation of the auto-memoization processor by utilizing a RAM and a Bloom filter. The result of the simulation experiment shows that power consumption of the table is reduced by 67.5% at a maximum and by 50.4% on average.","PeriodicalId":322499,"journal":{"name":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Exploiting Bloom Filters for Saving Power Consumption of Auto-Memoization Processor\",\"authors\":\"Masayoshi Fujii, Yuuki Sato, Tomoaki Tsumura, Y. Nakashima\",\"doi\":\"10.1109/CANDAR.2016.0069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have proposed a processor which can exploit valuelocalityinprogramsbyautomaticallyapplyingcomputation reuse. The processor which we call auto-memoization processor dynamically detects functions and loop iterations as reusable blocks, and stores their input sequences and results into a lookup table. When the current input sequence matches one of the stored input sequences on the table, the stored result associated with the matched input sequence is written back to the registers and caches. In the previous implementation, a part of the table is implemented with a CAM for achieving associative search for input matching with small overhead. However, CAMs consumeconsiderablylargeenergy, areaandmanufacturingcost. Therefore, CAM size should be as small as possible for improving practicality of the auto-memoization processor. In this paper, we propose a low-power implementation of the auto-memoization processor by utilizing a RAM and a Bloom filter. The result of the simulation experiment shows that power consumption of the table is reduced by 67.5% at a maximum and by 50.4% on average.\",\"PeriodicalId\":322499,\"journal\":{\"name\":\"2016 Fourth International Symposium on Computing and Networking (CANDAR)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Fourth International Symposium on Computing and Networking (CANDAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CANDAR.2016.0069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Fourth International Symposium on Computing and Networking (CANDAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDAR.2016.0069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

我们提出了一种通过自动应用计算重用来利用程序中的值局域性的处理器。我们称之为自动记忆处理器的处理器动态地检测函数和循环迭代作为可重用的块,并将它们的输入序列和结果存储到查找表中。当当前输入序列与表中存储的输入序列之一匹配时,与匹配的输入序列相关联的存储结果被写回寄存器和缓存。在前面的实现中,表的一部分是用CAM实现的,用于以很小的开销实现输入匹配的关联搜索。然而,cam消耗了相当大的能源、面积和制造成本。因此,为了提高自动记忆处理器的实用性,CAM尺寸应尽可能小。在本文中,我们提出了一种利用RAM和Bloom滤波器的低功耗自动记忆处理器。仿真实验结果表明,该表的功耗最大降低67.5%,平均降低50.4%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Exploiting Bloom Filters for Saving Power Consumption of Auto-Memoization Processor
We have proposed a processor which can exploit valuelocalityinprogramsbyautomaticallyapplyingcomputation reuse. The processor which we call auto-memoization processor dynamically detects functions and loop iterations as reusable blocks, and stores their input sequences and results into a lookup table. When the current input sequence matches one of the stored input sequences on the table, the stored result associated with the matched input sequence is written back to the registers and caches. In the previous implementation, a part of the table is implemented with a CAM for achieving associative search for input matching with small overhead. However, CAMs consumeconsiderablylargeenergy, areaandmanufacturingcost. Therefore, CAM size should be as small as possible for improving practicality of the auto-memoization processor. In this paper, we propose a low-power implementation of the auto-memoization processor by utilizing a RAM and a Bloom filter. The result of the simulation experiment shows that power consumption of the table is reduced by 67.5% at a maximum and by 50.4% on average.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信