THE LRPD TEST - SPECULATIVE RUN-TIME PARALLELIZATION OF LOOPS WITH PRIVATIZATION AND REDUCTION PARALLELIZATION
Conference Paper
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
1995 ACM. Current parallelizing compilers cannot identify a significantfraction 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 do all, and apply a fully parallel data dependence test to determine if it had any cross-iteration dependence; if the test fails, then the loop is re-executed serially. Since, from our experience, a significant amount of the available parallelism in Fortran programs can be exploited by loops transformed through privatization and reductionparallelization, 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 reduction recognition which goes beyond syntactic pattetm matching: It detects at run-time if the values stored in art 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.
name of conference
Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation - PLDI '95
