# A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architectures

Jonghee W. Yoon, Aviral Shrivastava, Sanghyun Park, Minwook Ahn, Yunheung Paek

Research output: Contribution to journalArticle

32 Citations (Scopus)

### Abstract

Recently coarse-grained reconfigurable architectures (CGRAs) have drawn increasing attention due to their efficiency and flexibility. While many CGRAs have demonstrated impressive performance improvements, the effectiveness of CGRA platforms ultimately hinges on the compiler. Existing CGRA compilers do not model the details of the CGRA, and thus they are i) unable to map applications, even though a mapping exists, and ii) using too many processing elements (PEs) to map an application. In this paper, we model several CGRA details, e.g., irregular CGRA topologies, shared resources and routing PEs in our compiler and develop a graph drawing based approach, Split-Push Kernel Mapping (SPKM), for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5$\times$ more applications than the previous approach, while generating mappings which have better qualities in terms of utilized CGRA resources. Utilizing fewer resources is directly translated into increased opportunities for novel power and performance optimization techniques. Our technique shows less power consumption in 71 cases and shorter execution cycles in 66 cases out of 100 synthetic applications, with minimum mapping time overhead. We observe similar results on a suite of benchmarks collected from Livermore loops, Mediabench, Multimedia, Wavelet and DSPStone benchmarks. SPKM is not a customized algorithm only for a specific CGRA template, and it is demonstrated by exploring various PE interconnection topologies and shared resource configurations with SPKM.

Original language English (US) 4801596 1565-1578 14 IEEE Transactions on Very Large Scale Integration (VLSI) Systems 17 11 https://doi.org/10.1109/TVLSI.2008.2001746 Published - Nov 2009

### Fingerprint

Drawing (graphics)
Reconfigurable architectures
Processing
Topology
Hinges

### Keywords

• Compiler
• Kernel mapping
• Reconfigurable architecture

### ASJC Scopus subject areas

• Electrical and Electronic Engineering
• Hardware and Architecture
• Software

### Cite this

A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architectures. / Yoon, Jonghee W.; Shrivastava, Aviral; Park, Sanghyun; Ahn, Minwook; Paek, Yunheung.

In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 17, No. 11, 4801596, 11.2009, p. 1565-1578.

Research output: Contribution to journalArticle

@article{d1581aa4b37a4709af0845e0d6c847c4,
title = "A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architectures",
abstract = "Recently coarse-grained reconfigurable architectures (CGRAs) have drawn increasing attention due to their efficiency and flexibility. While many CGRAs have demonstrated impressive performance improvements, the effectiveness of CGRA platforms ultimately hinges on the compiler. Existing CGRA compilers do not model the details of the CGRA, and thus they are i) unable to map applications, even though a mapping exists, and ii) using too many processing elements (PEs) to map an application. In this paper, we model several CGRA details, e.g., irregular CGRA topologies, shared resources and routing PEs in our compiler and develop a graph drawing based approach, Split-Push Kernel Mapping (SPKM), for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5$\times$ more applications than the previous approach, while generating mappings which have better qualities in terms of utilized CGRA resources. Utilizing fewer resources is directly translated into increased opportunities for novel power and performance optimization techniques. Our technique shows less power consumption in 71 cases and shorter execution cycles in 66 cases out of 100 synthetic applications, with minimum mapping time overhead. We observe similar results on a suite of benchmarks collected from Livermore loops, Mediabench, Multimedia, Wavelet and DSPStone benchmarks. SPKM is not a customized algorithm only for a specific CGRA template, and it is demonstrated by exploring various PE interconnection topologies and shared resource configurations with SPKM.",
keywords = "Compiler, Kernel mapping, Reconfigurable architecture",
author = "Yoon, {Jonghee W.} and Aviral Shrivastava and Sanghyun Park and Minwook Ahn and Yunheung Paek",
year = "2009",
month = "11",
doi = "10.1109/TVLSI.2008.2001746",
language = "English (US)",
volume = "17",
pages = "1565--1578",
journal = "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
issn = "1063-8210",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - A graph drawing based spatial mapping algorithm for coarse-grained reconfigurable architectures

AU - Yoon, Jonghee W.

AU - Shrivastava, Aviral

AU - Park, Sanghyun

AU - Ahn, Minwook

AU - Paek, Yunheung

PY - 2009/11

Y1 - 2009/11

N2 - Recently coarse-grained reconfigurable architectures (CGRAs) have drawn increasing attention due to their efficiency and flexibility. While many CGRAs have demonstrated impressive performance improvements, the effectiveness of CGRA platforms ultimately hinges on the compiler. Existing CGRA compilers do not model the details of the CGRA, and thus they are i) unable to map applications, even though a mapping exists, and ii) using too many processing elements (PEs) to map an application. In this paper, we model several CGRA details, e.g., irregular CGRA topologies, shared resources and routing PEs in our compiler and develop a graph drawing based approach, Split-Push Kernel Mapping (SPKM), for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5$\times$ more applications than the previous approach, while generating mappings which have better qualities in terms of utilized CGRA resources. Utilizing fewer resources is directly translated into increased opportunities for novel power and performance optimization techniques. Our technique shows less power consumption in 71 cases and shorter execution cycles in 66 cases out of 100 synthetic applications, with minimum mapping time overhead. We observe similar results on a suite of benchmarks collected from Livermore loops, Mediabench, Multimedia, Wavelet and DSPStone benchmarks. SPKM is not a customized algorithm only for a specific CGRA template, and it is demonstrated by exploring various PE interconnection topologies and shared resource configurations with SPKM.

AB - Recently coarse-grained reconfigurable architectures (CGRAs) have drawn increasing attention due to their efficiency and flexibility. While many CGRAs have demonstrated impressive performance improvements, the effectiveness of CGRA platforms ultimately hinges on the compiler. Existing CGRA compilers do not model the details of the CGRA, and thus they are i) unable to map applications, even though a mapping exists, and ii) using too many processing elements (PEs) to map an application. In this paper, we model several CGRA details, e.g., irregular CGRA topologies, shared resources and routing PEs in our compiler and develop a graph drawing based approach, Split-Push Kernel Mapping (SPKM), for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5$\times$ more applications than the previous approach, while generating mappings which have better qualities in terms of utilized CGRA resources. Utilizing fewer resources is directly translated into increased opportunities for novel power and performance optimization techniques. Our technique shows less power consumption in 71 cases and shorter execution cycles in 66 cases out of 100 synthetic applications, with minimum mapping time overhead. We observe similar results on a suite of benchmarks collected from Livermore loops, Mediabench, Multimedia, Wavelet and DSPStone benchmarks. SPKM is not a customized algorithm only for a specific CGRA template, and it is demonstrated by exploring various PE interconnection topologies and shared resource configurations with SPKM.

KW - Compiler

KW - Kernel mapping

KW - Reconfigurable architecture

UR - http://www.scopus.com/inward/record.url?scp=70350622992&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350622992&partnerID=8YFLogxK

U2 - 10.1109/TVLSI.2008.2001746

DO - 10.1109/TVLSI.2008.2001746

M3 - Article

VL - 17

SP - 1565

EP - 1578

JO - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

JF - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

SN - 1063-8210

IS - 11

M1 - 4801596

ER -