Abstract
Cross-iterations data dependences in DOACROSS loops require explicit data synchronizations to enforce them. However, the composite effect of some data synchronizations may cover the other dependences and make the enforcement of those covered dependences redundant. In this paper, we propose an efficient and general algorithm to identify redundant synchronizations in multiply nested DOACROSS loops which may have multiple statements and loop-exit control branches. Eliminating redundant sychronizations in DOACROSS loops allows more efficient execution of such loops. We also address the issues of enforcing data synchronizations in iterations near the boundary of the iteration space. Because some dependences may not exist in those boundary iterations, it adds complexity in determining the redundant synchronizations for those boundary iterations. The necessary and sufficient condition under which the synchronization is uniformly redundant is also studied. These results allow a parallelizing compiler to generate efficient data synchronization instructions for DOACROSS loops.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 459-470 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Parallel and Distributed Systems |
| Volume | 10 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1999 |
Bibliographical note
Funding Information:This work was supported in part by the U.S. National Science Foundation under Grant nos. NSF MIP-8920891, NSF MIP-9307910, and NSF MIP-9610379 and by the U.S. Department of Energy Grant no. DOE DE-FG02-85ER25001.