Implementing Dense Linear Algebra Algorithms Using Multitasking on the CRAY X-MP-4 (or Approaching the Gigaflop)
Authors:
- Jack J. DongarraJDJack J. Dongarra
- Tom HewittTHTom Hewitt
- 1 January 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 7 (1) , 347-350
Abstract
This note describes some experiments on simple, dense linear algebra algorithms. These experiments show that the CRAY X-MP is capable of small-grain multitasking arising from standard implementations of $LU$ and Cholesky decomposition. The implementation described here provides the “fastest” execution rate for $LU$ decomposition, 718 MFLOPS for a matrix of order 1000.
Keywords
This publication has 2 references indexed in Scilit:
- Squeezing the most out of an algorithm in CRAY FORTRANACM Transactions on Mathematical Software, 1984
- Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularityJournal of Parallel and Distributed Computing, 1984