HierCGRA: A Novel Framework for Large-scale CGRA with Hierarchical Modeling and Automated Design Space Exploration
Open Access
- 10 May 2024
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Reconfigurable Technology and Systems
- Vol. 17 (2) , 1-31
Abstract
Coarse-grained reconfigurable arrays (CGRAs) are promising design choices in computation-intensive domains, since they can strike a balance between energy efficiency and flexibility. A typical CGRA comprises processing elements (PEs) that can execute operations in applications and interconnections between them. Nevertheless, most CGRAs suffer from the ineffectiveness of supporting flexible architecture design and solving large-scale mapping problems. To address these challenges, we introduce HierCGRA, a novel framework that integrates hierarchical CGRA modeling, Chisel-based Verilog generation, LLVM-based data flow graph (DFG) generation, DFG mapping, and design space exploration (DSE). With the graph homomorphism (GH) mapping algorithm, HierCGRA achieves a faster mapping speed and higher PE utilization rate compared with the existing state-of-the-art CGRA frameworks. The proposed hierarchical mapping strategy achieves 41× speedup on average compared with the ILP mapping algorithm in CGRA-ME. Furthermore, the automated DSE based on Bayesian optimization achieves a significant performance improvement by the heterogeneity of PEs and interconnections. With these features, HierCGRA enables the agile development for large-scale CGRA and accelerates the process of finding a better CGRA architecture.Keywords
This publication has 53 references indexed in Scilit:
- THRAM: A Template-based Heterogeneous CGRA Modeling Framework Supporting Fast DSE2023
- An Architecture- Independent CGRA Compiler enabling OpenMP Applications2022
- Ultra-Elastic CGRAs for Irregular Loop Specialization2021
- ASAP7: A 7-nm finFET predictive process design kitMicroelectronics Journal, 2016
- Pareto Optimal Temporal Partition Methodology for Reconfigurable Architectures Based on Multi-objective Genetic Algorithm2012
- An effective multilevel tabu search approach for balanced graph partitioningComputers & Operations Research, 2011
- LLVM: A compilation framework for lifelong program analysis & transformation2004
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Partition-distance: A problem and class of perfect graphs arising in clusteringInformation Processing Letters, 2002
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970