The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we advocate a novel framework for their identification: speculatively execute the loop as a <tt>doall</tt> and apply a fully parallel data dependence test to determine if it had any cross-iteration dependences; if the test fails, then the loop is reexecuted serially. Since, from our experience, a significant amount of the available parallelism in Fortran programs can be exploited by loops transformed through <it>privatization</it> and <it>reduction parallelization</it>, our methods can speculatively apply these transformations and then check their validity at run-time. Another important contribution of this paper is a novel method for <it>reduction recognition</it> which goes beyond syntactic pattern matching: It detects at run-time if the values stored in an array participate in a reduction operation, even if they are transferred through private variables and/or are affected by statically unpredictable control flow. We present experimental results on loops from the PERFECT Benchmarks, which substantiate our claim that these techniques can yield significant speedups which are often superior to those obtainable by inspector/executor methods</p>
Compilers, parallel processing, speculative, run-time, DOALL, reduction, privatization.
David A. Padua, Lawrence Rauchwerger, "The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization", IEEE Transactions on Parallel & Distributed Systems, vol. 10, no. , pp. 160-180, February 1999, doi:10.1109/71.752782
99 ms
(Ver 3.3 (11022016))