Issue No. 10 - October (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.629489
<p><b>Abstract</b>—Vienna Fortran, High Performance Fortran (HPF), and other data parallel languages have been introduced to allow the programming of massively parallel distributed-memory machines (DMMP) at a relatively high level of abstraction, based on the SPMD paradigm. Their main features include directives to express the distribution of data and computations across the processors of a machine. In this paper, we use Vienna-Fortran as a general framework for dealing with sparse data structures. We describe new methods for the representation and distribution of such data on DMMPs, and propose simple language features that permit the user to characterize a matrix as "sparse" and specify the associated representation. Together with the data distribution for the matrix, this enables the compiler and runtime system to translate sequential sparse code into explicitly parallel message-passing code. We develop new compilation and runtime techniques, which focus on achieving storage economy and reducing communication overhead in the target program. The overall result is a powerful mechanism for dealing efficiently with sparse matrices in data parallel languages and their compilers for DMMPs.</p>
Data-parallel language and compiler, sparse computation, distributed-memory machines, runtime support.
M. Ujaldon, H. P. Zima, B. M. Chapman and E. L. Zapata, "Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 1068-1083, 1997.