Slicing Analysis and Indirect Accesses to Distributed Arrays

An increasing fraction of the applications targeted by parallel computers makes heavy use of indirection arrays for indexing data arrays. Such irregular access patterns make it difficult for a compiler to generate efficient parallel code. Previously developed techniques addressing this problem are limited in that they are only applicable for a single level of indirection. However, many codes using sparse data structures access their data through multiple levels of indirection.

[1]  Reinhard von Hanxleden,et al.  Evaluating parallel languages for molecular dynamics computations , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..

[2]  Joel H. Saltz,et al.  Unstructured scientific computation on scalable multiprocessors , 1992 .

[3]  Peter Brezany,et al.  Vienna Fortran - A Language Specification. Version 1.1 , 1992 .

[4]  Harry Berryman,et al.  Performance of Hashed Cache Data Migration Schemes on Multicomputers , 1991, J. Parallel Distributed Comput..

[5]  Joel H. Saltz,et al.  Principles of runtime support for parallel processors , 1988, ICS '88.

[6]  Ken Kennedy,et al.  Compiling Fortran D for MIMD distributed-memory machines , 1992, CACM.

[7]  Charles Koelbel,et al.  Compiling Global Name-Space Parallel Loops for Distributed Execution , 1991, IEEE Trans. Parallel Distributed Syst..

[8]  Ken Kennedy,et al.  Evaluation of compiler optimizations for Fortran D on MIMD distributed memory machines , 1992, ICS '92.

[9]  Ken Kennedy,et al.  Compiler optimizations for Fortran D on MIMD distributed-memory machines , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[10]  Barbara M. Chapman,et al.  Programming in Vienna Fortran , 1992, Sci. Program..

[11]  Ken Kennedy,et al.  Compiler Analysis for Irregular Problems in Fortran D , 1992, LCPC.

[12]  Joel H. Saltz,et al.  The incremental scheduler , 1992 .

[13]  Joel H. Saltz,et al.  Distributed memory compiler methods for irregular problems—data copy reuse and runtime partitioning , 1992 .

[14]  Harry Berryman,et al.  Multiprocessors and run-time compilation , 1991, Concurr. Pract. Exp..

[15]  G. A. Venkatesh,et al.  The semantic approach to program slicing , 1991, PLDI '91.

[16]  Joel H. Saltz,et al.  Parti Procedures for Realistic Loops , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.

[17]  Yousef Saad,et al.  SPARK: a benchmark package for sparse computations , 1990, ICS '90.

[18]  Rice UniversityCORPORATE,et al.  High performance Fortran language specification , 1993 .

[19]  Youcef Saad,et al.  A Basic Tool Kit for Sparse Matrix Computations , 1990 .