SPKM: A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures

Jonghee W. Yoon; Aviral Shrivastava; Sanghyun Park; Minwook Ahn; Reiley Jeyapaul; Yunheung Paek

doi:10.1109/ASPDAC.2008.4484056

SPKM: A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

48 Scopus citations

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 architecture, due to which they are, i) unable to map applications, even though a mapping exists, and ii) use too many PEs to map an application. In this paper, we model several CGRA details in our compiler and develop a graph mapping based approach (SPKM) for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5X more applications than the previous approaches, while using fewer CGRA rows 62% times, without any penalty in mapping time. We observe similar results on a suite of benchmarks collected from Livermore Loops, Multimedia and DSPStone benchmarks.

Original language	English (US)
Title of host publication	2008 Asia and South Pacific Design Automation Conference, ASP-DAC
Pages	776-782
Number of pages	7
DOIs	https://doi.org/10.1109/ASPDAC.2008.4484056
State	Published - 2008
Event	2008 Asia and South Pacific Design Automation Conference, ASP-DAC - Seoul, Korea, Republic of Duration: Mar 21 2008 → Mar 24 2008

Publication series

Name	Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Other

Other	2008 Asia and South Pacific Design Automation Conference, ASP-DAC
Country/Territory	Korea, Republic of
City	Seoul
Period	3/21/08 → 3/24/08

ASJC Scopus subject areas

Computer Science Applications
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering

Access to Document

10.1109/ASPDAC.2008.4484056

Cite this

Yoon, J. W., Shrivastava, A., Park, S., Ahn, M., Jeyapaul, R., & Paek, Y. (2008). SPKM: A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures. In 2008 Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 776-782). Article 4484056 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). https://doi.org/10.1109/ASPDAC.2008.4484056

SPKM: A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures. / Yoon, Jonghee W.; Shrivastava, Aviral; Park, Sanghyun et al.
2008 Asia and South Pacific Design Automation Conference, ASP-DAC. 2008. p. 776-782 4484056 (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yoon, JW, Shrivastava, A, Park, S, Ahn, M, Jeyapaul, R & Paek, Y 2008, SPKM: A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures. in 2008 Asia and South Pacific Design Automation Conference, ASP-DAC., 4484056, Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC, pp. 776-782, 2008 Asia and South Pacific Design Automation Conference, ASP-DAC, Seoul, Korea, Republic of, 3/21/08. https://doi.org/10.1109/ASPDAC.2008.4484056

Yoon JW, Shrivastava A, Park S, Ahn M, Jeyapaul R, Paek Y. SPKM: A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures. In 2008 Asia and South Pacific Design Automation Conference, ASP-DAC. 2008. p. 776-782. 4484056. (Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC). doi: 10.1109/ASPDAC.2008.4484056

@inproceedings{08479709407747a88c1d78be7d3cc211,

title = "SPKM: A novel graph drawing based algorithm for application mapping onto 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 architecture, due to which they are, i) unable to map applications, even though a mapping exists, and ii) use too many PEs to map an application. In this paper, we model several CGRA details in our compiler and develop a graph mapping based approach (SPKM) for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5X more applications than the previous approaches, while using fewer CGRA rows 62% times, without any penalty in mapping time. We observe similar results on a suite of benchmarks collected from Livermore Loops, Multimedia and DSPStone benchmarks.",

author = "Yoon, {Jonghee W.} and Aviral Shrivastava and Sanghyun Park and Minwook Ahn and Reiley Jeyapaul and Yunheung Paek",

year = "2008",

doi = "10.1109/ASPDAC.2008.4484056",

language = "English (US)",

isbn = "9781424419227",

series = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

pages = "776--782",

booktitle = "2008 Asia and South Pacific Design Automation Conference, ASP-DAC",

note = "2008 Asia and South Pacific Design Automation Conference, ASP-DAC ; Conference date: 21-03-2008 Through 24-03-2008",

}

TY - GEN

T1 - SPKM

T2 - 2008 Asia and South Pacific Design Automation Conference, ASP-DAC

AU - Yoon, Jonghee W.

AU - Shrivastava, Aviral

AU - Park, Sanghyun

AU - Ahn, Minwook

AU - Jeyapaul, Reiley

AU - Paek, Yunheung

PY - 2008

Y1 - 2008

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 architecture, due to which they are, i) unable to map applications, even though a mapping exists, and ii) use too many PEs to map an application. In this paper, we model several CGRA details in our compiler and develop a graph mapping based approach (SPKM) for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5X more applications than the previous approaches, while using fewer CGRA rows 62% times, without any penalty in mapping time. We observe similar results on a suite of benchmarks collected from Livermore Loops, Multimedia and DSPStone benchmarks.

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 architecture, due to which they are, i) unable to map applications, even though a mapping exists, and ii) use too many PEs to map an application. In this paper, we model several CGRA details in our compiler and develop a graph mapping based approach (SPKM) for mapping applications onto CGRAs. On randomly generated graphs our technique can map on average 4.5X more applications than the previous approaches, while using fewer CGRA rows 62% times, without any penalty in mapping time. We observe similar results on a suite of benchmarks collected from Livermore Loops, Multimedia and DSPStone benchmarks.

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

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

U2 - 10.1109/ASPDAC.2008.4484056

DO - 10.1109/ASPDAC.2008.4484056

M3 - Conference contribution

AN - SCOPUS:49549092193

SN - 9781424419227

T3 - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

SP - 776

EP - 782

BT - 2008 Asia and South Pacific Design Automation Conference, ASP-DAC

Y2 - 21 March 2008 through 24 March 2008

ER -

SPKM: A novel graph drawing based algorithm for application mapping onto Coarse-grained reconfigurable architectures

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this