A Resistive TCAM Accelerator for Data-Intensive Computing

被引:0
|
作者
Guo, Qing [2 ]
Guo, Xiaochen [1 ]
Bai, Yuxin [1 ]
Ipek, Engin [1 ,2 ]
机构
[1] Univ Rochester, Dept Elect & Comp Engn, Rochester, NY 14627 USA
[2] Univ Rochester, Dept Comp Sci, Rochester, NY 14627 USA
基金
美国国家科学基金会;
关键词
Resistive memory; TCAM; Accelerator; MEMORY; ARCHITECTURE;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Power dissipation and off-chip bandwidth restrictions are critical challenges that limit microprocessor performance. Ternary content addressable memories (TCAM) hold the potential to address both problems in the context of a wide range of data-intensive workloads that benefit from associative search capability. Power dissipation is reduced by eliminating instruction processing and data movement overheads present in a purely RAM based system. Bandwidth demand is lowered by processing data directly on the TCAM chip, thereby decreasing off-chip traffic. Unfortunately, CMOS-based TCAM implementations are severely power- and area-limited, which restricts the capacity of commercial products to a few megabytes, and confines their use to niche networking applications. This paper explores a novel resistive TCAM cell and array architecture that has the potential to scale TCAM capacity from megabytes to gigabytes. High-density resistive TCAM chips are organized into a DDR3-compatible DIMM, and are accessed through a software library with zero modifications to the processor or the motherboard. On applications that do not benefit from associative search, the TCAM DIMM is configured to provide ordinary RAM functionality. By tightly integrating TCAM with conventional virtual memory, and by allowing a large fraction of the physical address space to be made content-addressable on demand, the proposed memory system improves average performance by 4x and average energy consumption by 10x on a set of evaluated data-intensive applications.
引用
收藏
页码:339 / 350
页数:12
相关论文
共 50 条
  • [31] Data-Intensive Computing in Smart Microgrids: Volume II
    Herodotou, Herodotos
    Aslam, Sheraz
    ENERGIES, 2022, 15 (16)
  • [32] Hyracks: A Flexible and Extensible Foundation for Data-Intensive Computing
    Borkar, Vinayak
    Carey, Michael
    Grover, Raman
    Onose, Nicola
    Vernica, Rares
    IEEE 27TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2011), 2011, : 1151 - 1162
  • [33] A Data-Intensive Workflow Scheduling Algorithm for Grid Computing
    Xu, Meng
    Cui, Lizhen
    Wang, Haiyang
    Bi, Yanbing
    Bian, Ji
    FOURTH CHINAGRID ANNUAL CONFERENCE, PROCEEDINGS, 2009, : 110 - 115
  • [34] Special Issue on Data-Intensive Scalable Computing Systems
    Roth, Philip C.
    Canon, R. Shane
    PARALLEL COMPUTING, 2017, 61 : 1 - 2
  • [35] A new volunteer computing model for data-intensive applications
    Alonso-Monsalve, Saul
    Garcia-Carballeira, Felix
    Calderon, Alejandro
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2017, 29 (24):
  • [36] Rethinking Memory System Design for Data-Intensive Computing
    Mutlu, Onur
    Proceedings International Conference on Embedded Computer Systems - Architectures, Modeling and Simulation (SAMOS XV), 2015, : I - I
  • [37] Dynamic function placement for data-intensive cluster computing
    Amiri, K
    Petrou, D
    Ganger, GR
    Gibson, GA
    USENIX ASSOCIATION PROCEEDINGS OF THE 2000 USENIX ANNUAL TECHNICAL CONFERENCE, 2000, : 307 - 322
  • [38] Innovative methods and algorithms for advanced data-intensive computing
    Cuzzocrea, Alfredo
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2014, 37 : 60 - 63
  • [39] Maintaining Consistency in Data-Intensive Cloud Computing Environment
    Basu, Sruti
    Pattnaik, Prasant Kumar
    PROGRESS IN COMPUTING, ANALYTICS AND NETWORKING, ICCAN 2017, 2018, 710 : 257 - 264
  • [40] Nebula: Distributed Edge Cloud for Data-Intensive Computing
    Ryden, Mathew
    Oh, Kwangsung
    Chandra, Abhishek
    Weissman, Jon
    PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON COLLABORATION TECHNOLOGIES AND SYSTEMS (CTS), 2014, : 491 - 492