Memory Sizing of a Scalable SRAM In-Memory Computing Tile Based Architecture

被引:0
作者
Gauchi, R. [1 ]
Kooli, M. [1 ]
Vivet, P. [1 ]
Noel, J. -P. [1 ]
Beigne, E. [1 ]
Mitra, S. [3 ]
Charles, H. -P. [2 ]
机构
[1] Univ Grenoble Alpes, CEA Leti, MINATEC Campus, F-38054 Grenoble, France
[2] Univ Grenoble Alpes, CEA List, MINATEC Campus, F-38054 Grenoble, France
[3] Stanford Univ, 450 Serra Mall, Palo Alto, CA 94304 USA
来源
2019 IFIP/IEEE 27TH INTERNATIONAL CONFERENCE ON VERY LARGE SCALE INTEGRATION (VLSI-SOC) | 2019年
关键词
In-Memory Computing; Near Memory Computing; SRAM; interconnect; wire-cost;
D O I
10.1109/vlsi-soc.2019.8920373
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Modern computing applications require more and more data to be processed. Unfortunately, the trend in memory technologies does not scale as fast as the computing performances, leading to the so called memory wall. New architectures are currently explored to solve this issue, for both embedded and off-chip memories. Recent techniques that bringing computing as close as possible to the memory array such as, In-Memory Computing (IMC), Near-Memory Computing (NMC), Processing-In-Memory (PIM), allow to reduce the cost of data movement between computing cores and memories. For embedded computing, In-Memory Computing scheme presents advantageous computing and energy gains for certain class of applications. However, current solutions are not scaling to large size memories and high amount of data to compute. In this paper, we propose a new methodology to tile a SRAM/IMC based architecture and scale the memory requirements according to an application set. By using a high level LLVM-based simulation platform, we extract IMC memory requirements for a certain class of applications. Then, we detail the physical and performance costs of tiling SRAM instances. By exploring multi-tile SRAM Place&Route in 28nm FD-SOI, we explore the respective performance, energy and cost of memory interconnect. As a result, we obtain a detailed wire cost model in order to explore memory sizing trade-offs. To achieve a large capacity IMC memory, by splitting the memory in multiple sub-tiles, we can achieve lower energy (up to 78% gain) and faster (up to 49% gain) IMC tile compared to a single large IMC memory instance.
引用
收藏
页码:166 / 171
页数:6
相关论文
共 16 条
  • [1] Compute Caches
    Aga, Shaizeen
    Jeloka, Supreet
    Subramaniyan, Arun
    Narayanasamy, Satish
    Blaauw, David
    Das, Reetuparna
    [J]. 2017 23RD IEEE INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTER ARCHITECTURE (HPCA), 2017, : 481 - 492
  • [2] Akyel KC, 2016, 2016 IEEE INTERNATIONAL CONFERENCE ON REBOOTING COMPUTING (ICRC)
  • [3] [Anonymous], 2018, IEEE T CIRCUITS SYST
  • [4] [Anonymous], DATA CENTRIC SYSTEMS
  • [5] [Anonymous], INFORM COMPUTATION
  • [6] A 4+2T SRAM for Searching and In-Memory Computing With 0.3-V VDDmin
    Dong, Qing
    Jeloka, Supreet
    Saligane, Mehdi
    Kim, Yejoong
    Kawaminami, Masaru
    Harada, Akihiko
    Miyoshi, Satoru
    Yasuda, Makoto
    Blaauw, David
    Sylvester, Dennis
    [J]. IEEE JOURNAL OF SOLID-STATE CIRCUITS, 2018, 53 (04) : 1006 - 1015
  • [7] Neural Cache: Bit-Serial In-Cache Acceleration of Deep Neural Networks
    Eckert, Charles
    Wang, Xiaowei
    Wang, Jingcheng
    Subramaniyan, Arun
    Iyer, Ravi
    Sylvester, Dennis
    Blaauw, David
    Das, Reetuparna
    [J]. 2018 ACM/IEEE 45TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE (ISCA), 2018, : 383 - 396
  • [8] The Exact Online String Matching Problem: A Review of the Most Recent Results
    Faro, Simone
    Lecroq, Thierry
    [J]. ACM COMPUTING SURVEYS, 2013, 45 (02)
  • [9] Horowitz M, 2014, ISSCC DIG TECH PAP I, V57, P10, DOI 10.1109/ISSCC.2014.6757323
  • [10] Kooli Maha, 2017, 2017 International Symposium on Rapid System Prototyping (RSP), P43, DOI 10.1145/3130265.3130322