The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/29655
Record Status Checked
Record Id 29655
Title A Fully Asynchronous Multifrontal Solver using Distributed Dynamic Scheduling
Abstract We describe the main features and discuss the tuning of algorithms for the direct solution of sparse linear systems on distributed memory computers developed in the context of PARASOL (ESPRIT IV LTR Project (No 20160)). The algorithms use a multifrontal approach and are especially designed to cover a large class of problems. The problems can be symmetric positive definite, general symmetric, or unsymmetric matrices, all possibly rank deficient, and they can be provided by the user in several formats. The algorithms achieve high performance by exploiting parallelism coming from the sparsity in the problem and that available for dense matrices. The algorithms use a dynamic distributed task scheduling technique to accommodate numerical pivoting and to allow the migration of computational tasks to lightly loaded processors. Large computational tasks are divided into subtasks to enhance parallelism. Asynchronous communication is used throughout the solution process for the efficient overlap of communication and computation. We illustrate our design choices by experimental results obtained on a Cray SGI Origin 2000 and an IBM SP2 for test matrices provided by industrial partners in the PARASOL project.
Organisation CCLRC , CSE , CSE-NAG
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-1999-059. 1999. raltr-1999059.pdf 1999
Journal Article SIAM J Matrix Anal A 23, no. 1 (2001): 15-41. doi:10.1137/S0895479899358194 2001
Report RT/APO/99/02. 1999. 1999
Report TR/PA/99/28. 1999. 1999