Skip to Main content Skip to Navigation
Conference papers

A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization

Abstract : We present and analyze a general algorithm which computes efficient static schedulings of block computations for parallel sparse linear factorization. Our solver, based on a supernodal fan-in approach, is fully driven by this scheduling. We give an overview of the algorithms and present performance results on a 16-node IBM-SP2 with 66 MHz Power2 thin nodes for a collection of grid and irregular problems.
keyword : Sparse
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00346593
Contributor : Pierre Ramet <>
Submitted on : Thursday, December 11, 2008 - 6:43:10 PM
Last modification on : Saturday, May 4, 2019 - 1:26:38 AM

Identifiers

  • HAL Id : inria-00346593, version 1

Collections

Citation

Pascal Hénon, Pierre Ramet, Jean Roman. A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization. EuroPar'99, 1999, Toulouse, France. pp.1059-1067. ⟨inria-00346593⟩

Share

Metrics

Record views

136