PT-Map: Efficient Program Transformation Optimization for CGRA Mapping
Article No.: 14, Pages 1 - 6
Abstract
Coarse-Grained Reconfigurable Array (CGRA) is a parallel architecture providing high energy efficiency and spatial-temporal re-configurability. Beyond loop scheduling for throughput optimization, program transformation is also crucial in CGRA mapping to optimize overall performance and efficiency. However, existing studies on program transformation optimization face challenges in exploring the transformation space systematically and evaluating candidates efficiently, leading to sub-optimal results. To tackle these challenges, this paper introduces PT-Map, an efficient program transformation optimization framework for CGRA mapping. PT-Map defines a comprehensive transformation space and employs a CGRA-specialized top-down exploration approach. It also incorporates a bottom-up evaluation scheme using architectural parameters and a graph neural network-based predictive model. Experiments demonstrate that PT-Map achieves up to 2.95X/1.80X speedups and 59.0%/23.2% energy-delay-product (EDP) reductions over the state-of-the-art approaches MapZero and PBP, respectively.
References
[1]
U. Bondhugula et al. 2008. A practical automatic polyhedral parallelizer and locality optimizer. In PLDI.
[2]
S. Dave et al. 2018. RAMP: Resource-aware mapping for CGRAs. In DAC.
[3]
J. Ansel et al. 2014. OpenTuner: An Extensible Framework for Program Autotuning. In PACT.
[4]
Y. Guo et al. 2020. Pillars: An Integrated CGRA Design Framework. In WOSET.
[5]
T. Gysi et al. 2019. A fast analytical model of fully associative caches. In PLDI.
[6]
L. Huang et al. 2023. Optimizing Data Reuse for CGRA Mapping Using Polyhedral-based Loop Transformations. In DAC.
[7]
M. Karunaratne et al. 2017. HyCUBE: A CGRA with reconfigurable single-cycle multi-hop interconnect. In DAC.
[8]
D. Kingma et al. 2015. Adam: A method for stochastic optimization. In ICLR.
[9]
T. Kipf et al. 2017. Semi-supervised classification with graph convolutional networks. In ICLR.
[10]
X. Kong et al. 2023. MapZero: Mapping for Coarse-grained Reconfigurable Architectures with Reinforcement Learning and Monte-Carlo Tree Search. In ISCA.
[11]
Z. Li et al. 2022. LISA: Graph Neural Network based Portable Mapping on Spatial Accelerators. In HPCA.
[12]
D. Liu et al. 2013. Polyhedral model based mapping optimization of loop nests for CGRAs. In DAC.
[13]
D. Liu et al. 2021. Polyhedral-based Pipelining of Imperfectly-Nested Loop for CGRAs. In ICCAD.
[14]
L. Liu et al. 2017. HReA: An energy-efficient embedded dynamically reconfigurable fabric for 13-dwarfs processing. IEEE TCAS-II (2017).
[15]
B. Mei et al. 2003. ADRES: An architecture with tightly coupled VLIW processor and coarse-grained reconfigurable matrix. In FPL.
[16]
P. Veličković et al. 2018. Graph attention networks. In ICLR.
[17]
S. Yin et al. 2015. Joint affine transformation and loop pipelining for mapping nested loop on CGRAs. In DATE.
Index Terms
- PT-Map: Efficient Program Transformation Optimization for CGRA Mapping
Index terms have been assigned to the content through auto-classification.
Recommendations
ImageMap: Enabling Efficient Mapping from Image Processing DSL to CGRA
Euro-Par 2024: Parallel ProcessingAbstractImage processing has broad application scenarios and fast-developing algorithms, requiring hardware platforms with both high energy efficiency and flexible programmability. Coarse-grained Reconfigurable Arrays (CGRAs) show great potential with ...
On validation of ATL transformation rules by transformation models
MoDeVVa: Proceedings of the 8th International Workshop on Model-Driven Engineering, Verification and ValidationModel-to-model transformations constitute an important ingredient in model-driven engineering. As real world transformations are complex, systematic approaches are required to ensure their correctness. The ATLAS Transformation Language (ATL) is a mature ...
Point-free Program Transformation
Program Transformation: Theoretical Foundations and Basic Techniques. Part 1Functional programs are particularly well suited to formal manipulation by equational reasoning. In particular, it is straightforward to use calculational methods for program transformation. Well-known transformation techniques, like tupling or the ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 November 2024
Check for updates
Qualifiers
- Research-article
Funding Sources
Conference
DAC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,770 of 5,499 submissions, 32%
Upcoming Conference
DAC '25
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 86Total Downloads
- Downloads (Last 12 months)86
- Downloads (Last 6 weeks)29
Reflects downloads up to 06 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in