Ordering sparse matrices for cache-based systems
Conference
·
OSTI ID:787125
- LBNL Library
The Conjugate Gradient (CG) algorithm is the oldest and best-known Krylov subspace method used to solve sparse linear systems. Most of the coating-point operations within each CG iteration is spent performing sparse matrix-vector multiplication (SPMV). We examine how various ordering and partitioning strategies affect the performance of CG and SPMV when different programming paradigms are used on current commercial cache-based computers. However, a multithreaded implementation on the cacheless Cray MTA demonstrates high efficiency and scalability without any special ordering or partitioning.
- Research Organization:
- Lawrence Berkeley National Lab., CA (US)
- Sponsoring Organization:
- USDOE Director, Office of Science. Office of Advanced Scientific Computing Research. Mathematical, Information, and Computational Sciences Division (US)
- DOE Contract Number:
- AC03-76SF00098
- OSTI ID:
- 787125
- Report Number(s):
- LBNL--47805
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel conjugate gradient: effects of ordering strategies, programming paradigms, and architectural platforms
Ordering unstructured meshes for sparse matrix computations on leading parallel systems
Effects of ordering strategies and programming paradigms on sparse matrix computations
Conference
·
Mon May 01 00:00:00 EDT 2000
·
OSTI ID:775130
Ordering unstructured meshes for sparse matrix computations on leading parallel systems
Conference
·
Fri Dec 31 23:00:00 EST 1999
·
OSTI ID:751800
Effects of ordering strategies and programming paradigms on sparse matrix computations
Journal Article
·
Mon Dec 31 23:00:00 EST 2001
· SIAM review
·
OSTI ID:825126