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

Sep 1, 1999·
P. Hénon
,
P. Ramet
,
J. Roman
· 1 min read
URL
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.
Type
Publication
Proceedings of Euro-Par'99
publications

Add the full text or supplementary notes for the publication here using Markdown formatting.

Sparse