Yu, Yijun and D'Hollander, E. H.
(2004).
![[img]](http://oro.open.ac.uk/style/images/fileicons/application_pdf.png)
|
PDF (Accepted Manuscript)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (231kB) |
| DOI (Digital Object Identifier) Link: | https://doi.org/10.1109/ICPP.2004.1327909 |
|---|---|
| Google Scholar: | Look up in Google Scholar |
Abstract
Non-uniform distance loop dependences are a known obstacle to find parallel iterations. To find the outermost loop parallelism in these �irregular� loops, a novel method is presented based on recurrence chains. The scheme organizes non-uniformly dependent iterations into lexicographically ordered monotonic chains. While the initial and final iteration of monotonic chains form two parallel sets, the remaining iterations form an intermediate set that can be partitioned further. When there is only one pair of coupled array references, the non-uniform dependences are represented by a single recurrence equation. In that case, the chains in the intermediate set do not bifurcate and each can be executed as a WHILE loop. The independent iterations and the initial iterations of monotonic dependence chains constitute the outermost parallelism. The proposed approach compares favorably with other treatments of nonuniform dependences in the literature. When there are multiple recurrence equations, a dataflow parallel execution can be scheduled using the technique extensively to find maximum loop parallelism.
| Item Type: | Conference or Workshop Item |
|---|---|
| Copyright Holders: | 2004 IEEE |
| Extra Information: | Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. |
| Keywords: | WHILE loop; data flow execution; loop parallelism; nonuniform distance loop dependence; parallel iteration; recurrence chain; recurrence equation |
| Academic Unit/School: | Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications Faculty of Science, Technology, Engineering and Mathematics (STEM) |
| Research Group: | Centre for Research in Computing (CRC) |
| Item ID: | 24313 |
| Depositing User: | Yijun Yu |
| Date Deposited: | 22 Feb 2011 11:42 |
| Last Modified: | 02 May 2018 13:18 |
| URI: | http://oro.open.ac.uk/id/eprint/24313 |
| Share this page: |     |
Metrics
Altmetrics from Altmetric | Citations from Dimensions |
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)