Parallel sparse matrix vector multiplication using a shared virtual memory environment

Conference · Fri Dec 31 00:00:00 EST 1993

OSTI ID:54436

Bodin, F; Erhel, J; Priol, T ^[1]

---

1. IRISA - Campus Universitaire de Beaulieu, Rennes (France)

Many iterative schemes in scientific applications require the multiplication of a sparse matrix by a vector. This kernel has been mainly studied on vector processors and shared-memory parallel computers. In this paper, we address the implementation issues when using a shared virtual memory system on a distributed memory parallel computer. We study in details the impact of loop distribution schemes in order to design an efficient algorithm.

• OSTI ID: 54436
• Report Number(s): DOE/ER/25151-1-Vol.1; CONF-930331-Vol.1; CNN: Contract 1-92-C-250-00-31318-01-2; TRN: 94:007584-0074
• Resource Relation: Conference: 6. Society for Industrial and Applied Mathematics (SIAM) conference on parallel processing for scientific computing, Norfolk, VA (United States), 21-24 Mar 1993; Other Information: PBD: 1993; Related Information: Is Part Of Parallel processing for scientific computing: Proceedings. Volume 1; Sincovec, R.F.; Leuze, M.R. [eds.] [Oak Ridge National Lab., TN (United States)]; Keyes, D.E. [ed.] [Yale Univ., New Haven, CT (United States)]; Petzold, L.R. [ed.] [Minnesota Univ., Minneapolis, MN (United States)]; Reed, D.A. [ed.] [Illinois Univ., Chicago, IL (United States)]; PB: 522 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
PARALLEL PROCESSING
MEMORY MANAGEMENT
COMPUTER ARCHITECTURE
MATRICES
NUMERICAL SOLUTION
ALGORITHMS