DocumentCode
2035392
Title
Multicoloring for Fast Sparse Matrix-Vector Multiplication in Solving PDE Problems
Author
Wang, H.C. ; Hwang, Kai
Author_Institution
University of Southern California, Los Angeles, USA
Volume
3
fYear
1993
fDate
16-20 Aug. 1993
Firstpage
215
Lastpage
222
Abstract
A new multicoloring technique is proposed for parallel sparse matrix-vector multiplication, which dominates the computing cost of iterative PDE (partial differential equation) solvers. The new technique enables parallel solution of grid-structured nonsymmetric PDE problems on shared-memory multiprocessors through resolving memory access conflicts by multiple processors. The coloring scheme is formulated as an algebraic mapping which can be implemented with low overhead.
Keywords
Concurrent computing; Costs; Gradient methods; Mesh generation; Multiprocessing systems; Packaging; Parallel processing; Partial differential equations; Sparse matrices; Testing; Parallel processing; conjugate gradient methods; matrix-vector multiplication; multicoloring; partial differential equations.;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location
Syracuse, NY, USA
ISSN
0190-3918
Print_ISBN
0-8493-8983-6
Type
conf
DOI
10.1109/ICPP.1993.119
Filename
4134272
Link To Document