A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Speculative Parallelization of Partially Parallel Loops
[chapter]
2000
Lecture Notes in Computer Science
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. We have previously proposed a framework for their identification. We speculatively executed a loop as a doall, and applied a fully parallel data dependence test to determine if it had any cross-processor dependences; if the test failed, then the loop was re-executed serially. While this method exploits doall parallelism
doi:10.1007/3-540-40889-4_22
fatcat:4yiuncsiurawfivld6cn75cz2m