Mapping a Class of Dependence Algorithms to Coarse-grained Reconfigurable Arrays -- Architectural Parameters and Methodology

Hannig F, Dutta H, Teich J (2006)


Publication Language: English

Publication Type: Journal article

Publication year: 2006

Journal

Publisher: Inderscience Enterprises

Book Volume: 2

Pages Range: 114-127

Journal Issue: 1/2

DOI: 10.1504/IJES.2006.010170

Abstract

Existing compilation techniques for coarse-grained reconfigurable arrays are closely related to approaches from the DSP world. These approaches employ several loop transformations, like pipelining or temporal partitioning, but they are not able to exploit the full parallelism of a given algorithm and the computational potential of a typical 2-dimensional array. In this paper, - we present an overview of constraints which have to be considered when mapping applications to coarse-grained reconfigurable arrays - we present our design methodology for mapping regular algorithms onto massively parallel arrays which is characterised by loop parallelisation in the polytope model - in a first case study, we adapt our design methodology for targeting reconfigurable arrays. The case study shows that the presented regular mapping methodology may lead to highly efficient implementations taking into account the constraints of the architecture.

Authors with CRIS profile

Related research project(s)

How to cite

APA:

Hannig, F., Dutta, H., & Teich, J. (2006). Mapping a Class of Dependence Algorithms to Coarse-grained Reconfigurable Arrays -- Architectural Parameters and Methodology. International Journal of Embedded Systems, 2(1/2), 114-127. https://dx.doi.org/10.1504/IJES.2006.010170

MLA:

Hannig, Frank, Hritam Dutta, and Jürgen Teich. "Mapping a Class of Dependence Algorithms to Coarse-grained Reconfigurable Arrays -- Architectural Parameters and Methodology." International Journal of Embedded Systems 2.1/2 (2006): 114-127.

BibTeX: Download