DMCA
Scalable Parallel Sparse Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors (1999)
| Citations: | 6 - 2 self |
BibTeX
@MISC{Schenk99scalableparallel,
author = {Olaf Schenk and Klaus Gärtner and Wolfgang Fichtner},
title = {Scalable Parallel Sparse Factorization with Left-Right Looking Strategy on Shared Memory Multiprocessors},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
An efficient sparse LU factorization algorithm on popular shared memory multiprocessors is presented. Interprocess communication is critically important on these architectures - the algorithm introduces O(n) synchronization events only. No global barrier is used and a completely asynchronous scheduling scheme is one central point of the implementation. The algorithm aims at optimizing the single node performance and minimizing the communication overhead. It has been successfully tested on SUN Enterprise, DEC AlphaServer, SGI Origin 2000, Cray T90, J90, and NEC SX-4 parallel computers, delivering up to 2.3 GFlop/s on an eight processor DEC AlphaServer for medium-size semiconductor device simulations and structural engineering problems.
Keyphrases
shared memory multiprocessor scalable parallel sparse factorization left-right looking strategy communication overhead medium-size semiconductor device simulation synchronization event dec alphaserver interprocess communication central point sgi origin processor dec alphaserver algorithm introduces single node performance nec sx-4 parallel computer memory multiprocessor cray t90 structural engineering problem sun enterprise global barrier efficient sparse lu factorization algorithm
