Abstract
A technique for mapping irregular sparse matrix computations into regular parallel networks is proposed. It is based on regularization of the original irregular graph of an algorithm. For this aim, we use a mapping of an original index space corresponding to dense matrices into a new one, which corresponds to a chosen sparse-matrix storage scheme. This regularization is followed by space-time mappings, which transform the algorithm graph into resulting networks. The proposed approach is illustrated by the example of mapping matrix-vector multiplications.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Darte, A., Robert, Y.: Mapping uniform loop nests onto distributed memory architectures. Parallel Computing 20 (1994) 679–710
Hammond, S.W., Law, K.H.: Architecture and operation of a systolic engine for finite element computations. Computers and Structures 30 (1988) 365–374
Jennings, A., McKeown, J.J.: Matrix computation. J. Willey & Sons, 1992
Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to parallel computing. Benjamin/Cummings Publish. Comp., 1994
Kung, Y.: VLSI array processors. Prentice-Hall, Englewood Cliffs, 1988
Melhem, R.: Solution of linear systems with striped sparse matrices. Parallel Comput. 6 (1988) 165–184
Moreno, J.H., Lang, T.: Matrix computations on systolic-type arrays. Kluwer, 1992
Pissanetzky, Z.: Sparse matrix technology. Academic Press, London, 1984
Saad, Y.: Krylov subspace methods on supercomputers. SIAM J. Sci. Stat. Comput. 10 (1989) 1200–1232
Shang, W., Fortes, J.A.B.: On time mapping of uniform dependence algorithms into lower dimensional processor arrays. IEEE Trans. Parallel and Distr. Systems 3 (1992) 350–363
Wyrzykowski, R.: Processor arrays for matrix triangularisation with partial pivoting. IEE Proc. E, Comput. Digit. Tech. 139 (1992) 165–169
Wyrzykowski, R., Kanevski, J., Maslennikov, O.: Mapping recursive algorithms into processor arrays, in Proc. Int. Workshop Parallel Numerics'94, M. Vajtersic and P. Zinterhof eds., Bratislava, 1994, 169–191
Zhong, X., Rajopadhye, S., Wong, I.: Systematic generation of linear allocation functions in systolic array design. J. VLSI Signal Processing 4 (1992), 279–293 *** DIRECT SUPPORT *** A0008C42 00011
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wyrzykowski, R., Kanevski, J. (1997). A technique for mapping sparse matrix computations into regular processor arrays. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002750
Download citation
DOI: https://doi.org/10.1007/BFb0002750
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive