A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Partitioning loops with variable dependence distances
Proceedings 2000 International Conference on Parallel Processing
A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for array subscripts to be any linear combination of all loop indices. The solutions to the linear dependence equations established from such array subscripts are characterized by a pseudo distance matrix(PDM). Second, it allows us to exploit loop parallelism from the PDM by applying unimodular and partitioningdoi:10.1109/icpp.2000.876124 dblp:conf/icpp/YuD00 fatcat:x65qe5zudfd5fnd5xqavewxndm