Statement Re-Ordering for DOACROSS Loops (1994)
Cached
Download Links
- [ftp.csrd.uiuc.edu]
- [www.csrd.uiuc.edu]
- [ftp.csrd.uiuc.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 8 - 1 self |
BibTeX
@MISC{Chen94statementre-ordering,
author = {Ding-kai Chen and Pen-Chung Yew},
title = {Statement Re-Ordering for DOACROSS Loops},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we propose a new statement re-ordering algorithm for DOACROSS loops that overcomes some of the problems in the previous schemes. The new algorithm uses a hierarchical approach to locate strongly dependent statement groups and to order these groups considering critical dependences. A new optimization problem, dependence covering maximization, which was not discussed before is also introduced. It is shown that this optimization problem is NP-complete, and a heuristic algorithm is incorporated in our algorithm. Run-time complexity analysis is given for both algorithms. This new statement re-ordering scheme, combined with the dependence covering maximization, can be an important compiler optimization to parallelize loop structures for large scale coarse and fine grain parallelism. Keywords: Compiler Optimization, Data Dependence, Doacross Execution, Redundant Synchronization Elimination, Statement Re-ordering. This work was supported in part by the National Science Foundat...
