Reducing Memory Access Conflicts with Loop Transformation and Data Reuse on Coarse-grained Reconfigurable Architecture

被引:3
作者
Chen, Yuge [1 ]
Zhao, Zhongyuan [1 ,2 ]
Jiang, Jianfei [1 ]
He, Guanghui [1 ]
Mao, Zhigang [1 ]
Sheng, Weiguang [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Micro Nallo Elect, Shanghai, Peoples R China
[2] Cornell Univ, Sch Elect & Comp Engn, Ithaca, NY 14850 USA
来源
PROCEEDINGS OF THE 2021 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE 2021) | 2021年
关键词
CGRA; multi-bank memory; data reuse; spatial mapping;
D O I
10.23919/DATE51398.2021.9473971
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Coarse-Grained Reconfigurable Arrays (CGRAs) are promising to have low power consumption and high energy-efficiency characteristics as accelerators. Recent years, many research works focus on improving the programmability of the CGRAs by enabling the fast reconfiguration during execution. The performance of these CGRAs critically hinges upon the scheduling power of the compiler. One of the critical challenges is to reduce memory access conflicts using static compilation techniques. Memory accessing conflict brings the synchronization overhead which causes the pipelining stall and reduces CGRA performance. Existing compilers usually tackle this challenge by orchestrating the data placement of the on-chip global memory (OGM) in CGRA to let the parallel memory accesses avoid the bank conflict. However, we find bank conflict is not the only reason that causes the memory access conflicts. In some CGRAs, the bandwidth of the data network between OGM and processing element array (PEA) is also limited due to the low power design principle. The unbalanced network bandwidth loads is another reason that causes memory access conflicts. Furthermore, the redundant data access across iterations is one of the primary causes of memory access conflicts. Based on these observations, we provide a comprehensive and generalized compilation flow to reduce the memory conflicts. Firstly, we develop a loop transformation model to maximize the inter-iteration data reuse of the loops to reduce the memory accessing operations under the software pipelining scheme. Secondly, we enhance the bandwidth utilization of the network between OGM and PEA and avoid the bank conflict by providing a conflict-aware spatial mapping algorithm which can be easily integrated into existing CGRA modulo scheduling compilation flow. Experimental results show our method is capable of improving performance by an average of 44% comparing with state-of-the-art CGRA compiling flow.
引用
收藏
页码:124 / 129
页数:6
相关论文
共 19 条
  • [1] Akbari O, 2018, DES AUT TEST EUROPE, P413, DOI 10.23919/DATE.2018.8342045
  • [2] A practical automatic polyhedral parallelizer and locality optimizer
    Bondhugula, Uday
    Hartono, Albert
    Ramanujam, J.
    Sadayappan, P.
    [J]. ACM SIGPLAN NOTICES, 2008, 43 (06) : 101 - 113
  • [3] Bouwens F, 2007, LECT NOTES COMPUT SC, V4419, P1
  • [4] Chin SA, 2017, IEEE INT CONF ASAP, P184, DOI 10.1109/ASAP.2017.7995277
  • [5] RAMP: Resource-Aware Mapping for CGRAs
    Dave, Shail
    Balasubramanian, Mahesh
    Shrivastava, Aviral
    [J]. 2018 55TH ACM/ESDA/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2018,
  • [6] Feautrier P, 1996, INT J PARALLEL PROG, V21
  • [7] Hamzeh M, 2013, DES AUT CON
  • [8] High Throughput Data Mapping for Coarse-Grained Reconfigurable Architectures
    Kim, Yongjoo
    Lee, Jongeun
    Shrivastava, Aviral
    Yoon, Jonghee W.
    Cho, Doosan
    Paek, Yunheung
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2011, 30 (11) : 1599 - 1609
  • [9] Operation and Data Mapping for CGRAs with Multi-bank Memory
    Kim, Yongjoo
    Lee, Jongeun
    Shrivastava, Aviral
    Paek, Yunheung
    [J]. ACM SIGPLAN NOTICES, 2010, 45 (04) : 17 - 25
  • [10] Kwon H, 2018, ACM SIGPLAN NOTICES, V53, P461, DOI [10.1145/3296957.3173176, 10.1145/3173162.3173176]