Implementing dense linear algebra algorithms using multitasking on the CRAY X-MP-4 (or approaching the gigaflop)
Technical Report
·
OSTI ID:6190749
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.
- Research Organization:
- Argonne National Lab., IL (USA)
- DOE Contract Number:
- W-31-109-ENG-38
- OSTI ID:
- 6190749
- Report Number(s):
- ANL/MCS-TM-55; ON: DE86004093
- Country of Publication:
- United States
- Language:
- English
Similar Records
Experience of implementing applicative parallelism on Cray X-MP
Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularity
Gigaflop speed algorithm for the direct solution of large block-tridiagonal systems in 3-D physics applications
Conference
·
Sun May 01 00:00:00 EDT 1988
·
OSTI ID:6190749
Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularity
Journal Article
·
Wed Aug 01 00:00:00 EDT 1984
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6190749
Gigaflop speed algorithm for the direct solution of large block-tridiagonal systems in 3-D physics applications
Journal Article
·
Wed Mar 01 00:00:00 EST 1989
· Comput. Phys.; (United States)
·
OSTI ID:6190749
+1 more