A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers
2004
Journal of Supercomputing
In order to achieve higher load balancing, it is necessary to solve irregular block redistribution problems, which are different from regular block-cyclic redistribution. High Performance Fortran version 2 (HPF-2) provides irregular distribution functionalities, such as GEN BLOCK and INDIRECT. This paper is devoted to develop an efficient algorithm that attempts to obtain near optimal scheduling while satisfying the conditions of minimal message size of total steps and the minimal number of
doi:10.1023/b:supe.0000026848.34971.27
fatcat:mvqezosspve5bfyzc7g6skajle