Abstract
This paper discusses the implementation of LAPACK routines on a cache-based, shared memory system. The shortcomings of an approach which relies on parallelized BLAS are illustrated in the cases of LU, Cholesky and QR factorizations. An alternative approach to these factorization routines, exploiting explicit parallelism at a higher level in the code, is reported: this provides higher scalability and efficiency in all cases studied. Issues of portability were addressed by using standard Fortran 77 and PCF compiler directives in all codes.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorensen: LAPACK Users' Guide, Release 2.0. SIAM, Philadelphia, 1995.
J.J. Dongarra, J.J. Du Croz, I.S.Duff, S. Hammarling: A Set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math, Softw., 16 pp. 1–17, 1990.
S.Salvini, J.Waśniewski: Experiences in Developing Numerical Subprograms on a Parallel, Shared Memory Computer. NAG Technical Report TR5/96, Oxford, 1996. Also in UNI•C Technical Report UNIC-96–04, Copenhagen, 1996.
S.Salvini: Numerical Libraries on Shared Memory Computers, PARA'96 Workshop, 1996.
Silicon Graphics Computer Systems, “POWER CHALLENGE Supercomputing Servers”, Silicon Graphics Computer Systems, Marketing Dept, Supercomputing Systems Div., 485 Central Avenue, Mountain View, CA 9043, USA, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salvini, S., Waśniewski, J. (1996). Linear algebra subprograms on shared memory computers: Beyond LAPACK. In: Waśniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds) Applied Parallel Computing Industrial Computation and Optimization. PARA 1996. Lecture Notes in Computer Science, vol 1184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62095-8_66
Download citation
DOI: https://doi.org/10.1007/3-540-62095-8_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62095-2
Online ISBN: 978-3-540-49643-4
eBook Packages: Springer Book Archive