Please use this identifier to cite or link to this item:
Title: Loop striping : maximizing parallelism for nested loops
Authors: Xue, C
Shao, Z 
Liu, ML
Qiu, ML
Sha, EHM
Issue Date: 2006
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), v. 4096, p. 405-414 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: The 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 a stripe is a group of iterations in which all iterations 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.
Description: International Conference on Embedded and Ubiquitous Computing (EUC 2006), Seoul, Korea, 1-4 Aug 2006
ISBN: 978-3-540-36679-9 (print)
978-3-540-36681-2 (online)
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/11802167_42
Appears in Collections:Conference Paper

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

Page view(s)

Last Week
Last month
Citations as of Dec 3, 2018

Google ScholarTM



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