Abstract
The Sperry ISP appears to be an attractive machine for implementing standard linear algebraic algorithms. It has similar characteristics to other vector-processing machines with an architecture based on vector-registers. Good performance of standard algorithms can be obtained via efficient implementations of matrix-vector operations, and we strongly recommend that these are added to the EML Library.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Daly and J.J. Du Croz, Performance of subroutine library on vector-processing machines, Computer Physics Comm. 37, 181–186, 1985.
J.J. Dongarra, Performance of various computers using standard linear equations software in a Fortran environment, Argonne National Laboratory report MCS/TM23, 1986.
J.J. Dongarra, J.J. Du Croz, S. J. Hammarling and R.J. Hanson, An extended set of Fortran basic linear algebra subprograms, NAG technical report TR3/87, 1987, and Argonne National Laboratory report MCS/TM41 (revision 3), 1986.
J.J. Dongarra and S. C. Eisenstat, Squeezing the most out of an algorithm in Cray Fortran, ACM Trans. Math. Software 10, 221–230, 1984.
C.L. Lawson, R.J. Hanson, D. R. Kincaid and F. T. Krogh, Basic linear algebra subprograms for Fortran usage, ACM Trans. Math. Software 5, 308–323, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Du Croz, J.J., Wasniewski, J. (1988). Basic linear algebra computations on the Sperry ISP. In: Houstis, E.N., Papatheodorou, T.S., Polychronopoulos, C.D. (eds) Supercomputing. ICS 1987. Lecture Notes in Computer Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18991-2_37
Download citation
DOI: https://doi.org/10.1007/3-540-18991-2_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18991-6
Online ISBN: 978-3-540-38888-3
eBook Packages: Springer Book Archive