Improving Performance of Nested Loops on Reconfigurable Array Processors
Cited 0 times inCited 7 times in
- Improving Performance of Nested Loops on Reconfigurable Array Processors
- Kim, Yongjoo; Lee, Jongeun; Mai, Toan X.; Paek, Yunheung
- Co-processors; Coarse grained reconfigurable architecture; Communication delays; Compilation; Conventional approach; Cooperative schemes; Execution time; Improving performance; Loop nests; Nested Loops; Outer loop; Reconfigurable array; Set-up time; Software pipelining; Steady state performance; Two processors
- Issue Date
- ASSOC COMPUTING MACHINERY
- ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, v.8, no.4, pp.1 - 23
- Pipelining algorithms are typically concerned with improving only the steady-state performance, or the kernel time. The pipeline setup time happens only once and therefore can be negligible compared to the kernel time. However, for Coarse-Grained Reconfigurable Architectures (CGRAs) used as a coprocessor to a main processor, pipeline setup can take much longer due to the communication delay between the two processors, and can become significant if it is repeated in an outer loop of a loop nest. In this paper we evaluate the overhead of such non-kernel execution times when mapping nested loops for CGRAs, and propose a novel architecture-compiler cooperative scheme to reduce the overhead, while also minimizing the number of extra configurations required. Our experimental results using loops from multimedia and scientific domains demonstrate that our proposed techniques can greatly increase the performance of nested loops by up to 2.87 times compared to the conventional approach of accelerating only the innermost loops. Moreover, the mappings generated by our techniques require only a modest number of configurations that can fit in recent reconfigurable architectures.
- ; Go to Link
Appears in Collections:
- ECE_Journal Papers
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.