基于预计算的低功耗内容可寻址存储器的数据驱动方法

Tsung-Sheng Lai, Chin-Hung Peng, F. Lai
{"title":"基于预计算的低功耗内容可寻址存储器的数据驱动方法","authors":"Tsung-Sheng Lai, Chin-Hung Peng, F. Lai","doi":"10.1109/ISCI.2011.5958936","DOIUrl":null,"url":null,"abstract":"Content addressable memory (CAM) plays an important role in the performance of many applications such as DCT transforms, processor caches, database accelerators, and network routers because it enables high-speed search operations with hardware acceleration. However, the power consumption of CAM is rather high because within CAM, searching is conducted in parallel for all registered words. Hence, pre-computation-based CAM, i.e., PB-CAM, was proposed in [1] in order to reduce the number of parallel-operated words by first filtering using a precomputation circuit called the parameter extractor. In this work, we propose a data driven algorithm — local grouping (LG) — to synthesize a parameter extractor for PB-CAM such that the registered data can be uniformly mapped to construct parameters; the cost of implementing the parameter extractor is also decreased. Moreover, we also adopt a discard and interlace (DAI) method that can further reduce the impact on non-uniform cases, which happens when most data are identical in some data blocks before LG processing. In experiments, average power consumption reduction of 60.4% was achieved and the number of CMOSs used was also reduced by 0.52%, when compared with the conventional gate-block selection algorithm [2].","PeriodicalId":166647,"journal":{"name":"2011 IEEE Symposium on Computers & Informatics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Data driven approach for low-power pre-computation-based content addressable memory\",\"authors\":\"Tsung-Sheng Lai, Chin-Hung Peng, F. Lai\",\"doi\":\"10.1109/ISCI.2011.5958936\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Content addressable memory (CAM) plays an important role in the performance of many applications such as DCT transforms, processor caches, database accelerators, and network routers because it enables high-speed search operations with hardware acceleration. However, the power consumption of CAM is rather high because within CAM, searching is conducted in parallel for all registered words. Hence, pre-computation-based CAM, i.e., PB-CAM, was proposed in [1] in order to reduce the number of parallel-operated words by first filtering using a precomputation circuit called the parameter extractor. In this work, we propose a data driven algorithm — local grouping (LG) — to synthesize a parameter extractor for PB-CAM such that the registered data can be uniformly mapped to construct parameters; the cost of implementing the parameter extractor is also decreased. Moreover, we also adopt a discard and interlace (DAI) method that can further reduce the impact on non-uniform cases, which happens when most data are identical in some data blocks before LG processing. In experiments, average power consumption reduction of 60.4% was achieved and the number of CMOSs used was also reduced by 0.52%, when compared with the conventional gate-block selection algorithm [2].\",\"PeriodicalId\":166647,\"journal\":{\"name\":\"2011 IEEE Symposium on Computers & Informatics\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Symposium on Computers & Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCI.2011.5958936\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Symposium on Computers & Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCI.2011.5958936","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

内容可寻址内存(CAM)在许多应用程序(如DCT转换、处理器缓存、数据库加速器和网络路由器)的性能中起着重要作用,因为它支持使用硬件加速进行高速搜索操作。然而,CAM的功耗很高,因为在CAM中,对所有注册的单词进行并行搜索。因此,在[1]中提出了基于预计算的CAM,即PB-CAM,通过使用称为参数提取器的预计算电路首先进行滤波,以减少并行操作的单词数量。在这项工作中,我们提出了一种数据驱动算法-局部分组(LG) -来合成PB-CAM的参数提取器,使注册的数据可以统一映射到构造参数;实现参数提取器的成本也降低了。此外,我们还采用了丢弃和交错(DAI)方法,可以进一步减少对非均匀情况的影响,这种情况发生在LG处理前某些数据块中的大多数数据相同时。在实验中,与传统的栅极选择算法相比,平均功耗降低了60.4%,使用的CMOSs数量也减少了0.52%[2]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Data driven approach for low-power pre-computation-based content addressable memory
Content addressable memory (CAM) plays an important role in the performance of many applications such as DCT transforms, processor caches, database accelerators, and network routers because it enables high-speed search operations with hardware acceleration. However, the power consumption of CAM is rather high because within CAM, searching is conducted in parallel for all registered words. Hence, pre-computation-based CAM, i.e., PB-CAM, was proposed in [1] in order to reduce the number of parallel-operated words by first filtering using a precomputation circuit called the parameter extractor. In this work, we propose a data driven algorithm — local grouping (LG) — to synthesize a parameter extractor for PB-CAM such that the registered data can be uniformly mapped to construct parameters; the cost of implementing the parameter extractor is also decreased. Moreover, we also adopt a discard and interlace (DAI) method that can further reduce the impact on non-uniform cases, which happens when most data are identical in some data blocks before LG processing. In experiments, average power consumption reduction of 60.4% was achieved and the number of CMOSs used was also reduced by 0.52%, when compared with the conventional gate-block selection algorithm [2].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信