Implementing Dense Linear Algebra Algorithms Using Multitasking on the CRAY X-MP-4 (Or Approaching the Gigaflop)

摘要

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. (ERA citation 11:008147)