Parallel Computing Technologies

The paper is devoted to the problem of mapping affine loop nests onto distributed memory parallel computers. An algorithm to find an efficient scheduling and distribution of data and operations to virtual processors is presented. It reduces the sheduling and the alignment problems to the solving of linear algebraic equations. The algorithm finds the maximal degree of pipelined parallelism and tries to minimize the number of nonlocal communications.

[1]  Chris Walshaw,et al.  Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm , 2000, SIAM J. Sci. Comput..

[2]  Rolf Niedermeier,et al.  On Multi-dimensional Hilbert Indexings , 1998, COCOON.

[3]  Vivek Sarkar.  Optimized unrolling of nested loops , 2000, ICS '00.

[4]  Jens-Michael Wierum,et al.  On the Quality of Partitions Based on Space-Filling Curves , 2002, International Conference on Computational Science.

[5]  Bruce Hendrickson,et al.  Dynamic load balancing in computational mechanics , 2000 .

[6]  Jenn-Yuan Tsai,et al.  Compiler Techniques for the Superthreaded Architectures1, 2 , 1999, International Journal of Parallel Programming.

[7]  Tamara G. Kolda,et al.  Graph partitioning models for parallel computing , 2000, Parallel Comput..

[8]  Charles M. Fiduccia,et al.  A linear-time heuristic for improving network partitions , 1988, 25 years of DAC.

[9]  Michael Wolfe,et al.  Data dependence and its application to parallel processing , 2005, International Journal of Parallel Programming.

[10]  Gerhard Zumbusch.  Load Balancing for Adaptively Refined Grids , 2002 .

[11]  Kuo-Cheng Li.  A note on the vector C language , 1986, SIGP.

[12]  Uri C. Weiser,et al.  MMX technology extension to the Intel architecture , 1996, IEEE Micro.

[13]  R. Diekmann,et al.  Using helpful sets to improve graph bisections , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[14]  Ralf Diekmann,et al.  PARTY - A Software Library for Graph Partitioning , 1997 .

[15]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[16]  R. Govindarajan,et al.  A Vectorizing Compiler for Multimedia Extensions , 2000, International Journal of Parallel Programming.

[17]  Gerhard Zumbusch,et al.  On the Quality of Space-Filling Curve Induced Partitions , 2000 .

[18]  H. Sagan.  Space-filling curves , 1994 .

[19]  Vipin Kumar,et al.  Graph partitioning for high-performance scientific simulations , 2003 .

[20]  Fred Weber,et al.  AMD 3DNow! technology: architecture and implementations , 1999, IEEE Micro.

[21]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .