The Community for Technology Leaders
Green Image
<p>An efficient algorithm to remove redundant dependences in simple loops with constant dependences is presented. Dependences constrain the parallel execution of programs and are typically enforced by synchronization instructions. The synchronization instructions represent a significant part of the overhead in the parallel execution of a program. Some program dependences are redundant because they are covered by other dependences. It is shown that unlike with single loops, in the case of nested loops, a particular dependence may be redundant at some iterations but not redundant at others, so that the redundancy of a dependence may not be uniform over the entire iteration space. A sufficient condition for the uniformity of redundancy in a doubly nested loop is developed.</p>
Index TermsDOACROSS loops; constant dependences; redundant dependences; simple loops; parallelexecution; synchronization instructions; nested loops; iteration space; doubly nestedloop; directed graphs; parallel programming; redundancy
P. Sadayappan, V.P. Krothapalli, "Removal of Redundant Dependences in DOACROSS Loops with Constant Dependences", IEEE Transactions on Parallel & Distributed Systems, vol. 2, no. , pp. 281-289, July 1991, doi:10.1109/71.86104
92 ms
(Ver 3.1 (10032016))