Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20824
Title: Maximize parallelism minimize overhead for nested loops via loop striping
Authors: Xue, C
Sha, EH
Shao, Z 
Keywords: Loop transformation
Optimization
Parallelism
Issue Date: 2007
Publisher: Kluwer Academic Publishers
Source: Journal of VLSI signal processing systems for signal, image, and video technology, 2007, v. 47, no. 2, p. 153-167 How to cite?
Journal: Journal of VLSI signal processing systems for signal, image, and video technology 
Abstract: Majority of scientific and Digital Signal Processing (DSP) applications are recursive or iterative. Transformation techniques are generally applied to increase parallelism for these nested loops. Most of the existing loop transformation techniques either can not achieve maximum parallelism, or can achieve maximum parallelism but with complicated loop bounds and loop indexes calculations. This paper proposes a new technique, loop striping, that can maximize parallelism while maintaining the original row-wise execution sequence with minimum overhead. Loop striping groups iterations into stripes, where all iterations in a stripe are independent and can be executed in parallel. Theorems and efficient algorithms are proposed for loop striping transformations. The experimental results show that loop striping always achieves better iteration period than software pipelining and loop unfolding, improving average iteration period by 50 and 54% respectively.
URI: http://hdl.handle.net/10397/20824
ISSN: 0922-5773
EISSN: 1573-109X
DOI: 10.1007/s11265-006-0034-5
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Last Week
0
Last month
0
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Aug 5, 2017

Page view(s)

35
Last Week
3
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.