New data-parallel language features for sparse matrix computations

Authors:
Manuel Ujaldon;Emilio L. Zapata;Barbara M. Chapman;Hans P. Zima
Affiliations:
-;-;-;-
Venue:
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Year:
1995

Citing 0
Cited 4

Efficient resolution of sparse indirections in data-parallel compilers

ICS '95 Proceedings of the 9th international conference on Supercomputing
Parallel Sparse Supports for Array Intrinsic Functions of Fortran 90

The Journal of Supercomputing
Support and optimization for parallel sparse programs with array intrinsics of Fortran 90

Parallel Computing
Data distribution schemes of sparse arrays on distributed memory multicomputers

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

High level data parallel languages such as Vienna Fortran and High Performance Fortran (HPF) have been introduced to allow the programming of massively parallel distributed memory machines at a relatively high level of abstraction, based on the single program multiple data (SPMD) paradigm. Their main features include mechanisms for expressing the distribution of data across the processors of a machine. The paper introduces additional language functionality to allow the efficient processing of sparse matrix codes. It introduces methods for the representation and distribution of sparse matrices, which forms a powerful mechanism for storing and manipulating sparse matrices able to be efficiently implemented on massively parallel machines.