Scalable application mapping for SIMD reconfigurable architecture
|dc.identifier.citation||JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, v.15, no.6, pp.634 - 646||ko|
|dc.description.abstract||Coarse-Grained Reconfigurable Architecture (CGRA) is a very promising platform that provides fast turn-around-time as well as very high energy efficiency for multimedia applications. One of the problems with CGRAs, however, is application mapping, which currently does not scale well with geometrically increasing numbers of cores. To mitigate the scalability problem, this paper discusses how to use the SIMD (Single Instruction Multiple Data) paradigm for CGRAs. While the idea of SIMD is not new, SIMD can complicate the mapping problem by adding an additional dimension of iteration mapping to the already complex problem of operation and data mapping, which are all interdependent, and can thus significantly affect performance through memory bank conflicts. In this paper, based on a new architecture called SIMD reconfigurable architecture, which allows SIMD execution at multiple levels of granularity, we present how to minimize bank conflicts considering all three related sub-problems, for various RA organizations. We also present data tiling and evaluate a conflictfree scheduling algorithm as a way to eliminate bank conflicts for a certain class of mapping problem.||ko|
|dc.publisher||IEEK PUBLICATION CENTER||ko|
|dc.title||Scalable application mapping for SIMD reconfigurable architecture||ko|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.