Key concepts for parallel out-of-core LU factorization

Jack J. Dongarra; Sven Hammarling; David W. Walker

Key concepts for parallel out-of-core LU factorization

Jack J. Dongarra
, Sven Hammarling
, David W. Walker

Research output: Contribution to journal › Article › peer-review

Abstract

This paper considers key ideas in the design of out-of-core dense LU factorization routines. A left-looking variant of the LU factorization algorithm is shown to require less I/O to disk than the right-looking variant, and is used to develop a parallel, out-of-core implementation. This implementation makes use of a small library of parallel I/O routines, together with ScaLAPACK and PBLAS routines. Results for runs on an Intel Paragon are presented and interpreted using a simple performance model.

Original language	English
Pages (from-to)	49-70
Number of pages	21
Journal	Parallel Computing
Volume	23
Issue number	1-2
Publication status	Published - Apr 1997

Keywords

LU factorization
Out-of-core computation
Parallel computing
Parallel I/O

Access to Document

Cite this

@article{62be494b9c38450e89ebb166ea51f2a9,

title = "Key concepts for parallel out-of-core LU factorization",

abstract = "This paper considers key ideas in the design of out-of-core dense LU factorization routines. A left-looking variant of the LU factorization algorithm is shown to require less I/O to disk than the right-looking variant, and is used to develop a parallel, out-of-core implementation. This implementation makes use of a small library of parallel I/O routines, together with ScaLAPACK and PBLAS routines. Results for runs on an Intel Paragon are presented and interpreted using a simple performance model.",

keywords = "LU factorization, Out-of-core computation, Parallel computing, Parallel I/O",

author = "Dongarra, \{Jack J.\} and Sven Hammarling and Walker, \{David W.\}",

year = "1997",

month = apr,

language = "English",

volume = "23",

pages = "49--70",

journal = "Parallel Computing",

publisher = "Elsevier BV",

number = "1-2",

}

TY - JOUR

T1 - Key concepts for parallel out-of-core LU factorization

AU - Dongarra, Jack J.

AU - Hammarling, Sven

AU - Walker, David W.

PY - 1997/4

Y1 - 1997/4

N2 - This paper considers key ideas in the design of out-of-core dense LU factorization routines. A left-looking variant of the LU factorization algorithm is shown to require less I/O to disk than the right-looking variant, and is used to develop a parallel, out-of-core implementation. This implementation makes use of a small library of parallel I/O routines, together with ScaLAPACK and PBLAS routines. Results for runs on an Intel Paragon are presented and interpreted using a simple performance model.

AB - This paper considers key ideas in the design of out-of-core dense LU factorization routines. A left-looking variant of the LU factorization algorithm is shown to require less I/O to disk than the right-looking variant, and is used to develop a parallel, out-of-core implementation. This implementation makes use of a small library of parallel I/O routines, together with ScaLAPACK and PBLAS routines. Results for runs on an Intel Paragon are presented and interpreted using a simple performance model.

KW - LU factorization

KW - Out-of-core computation

KW - Parallel computing

KW - Parallel I/O

M3 - Article

VL - 23

SP - 49

EP - 70

JO - Parallel Computing

JF - Parallel Computing

IS - 1-2

ER -

Key concepts for parallel out-of-core LU factorization

Abstract

Keywords

Access to Document

Fingerprint

Cite this