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.
https://hal.inria.fr/inria-00346593 Contributor : Pierre RametConnect in order to contact the contributor Submitted on : Thursday, December 11, 2008 - 6:43:10 PM Last modification on : Saturday, June 25, 2022 - 10:31:17 AM
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⟩