Performance study of LU factorization with low communication overhead on multiprocessors

F. Desprez; J. J. Dongarra; B. Tourancheau

doi:10.1142/S012962649500014X

Performance study of LU factorization with low communication overhead on multiprocessors

F. Desprez
, J. J. Dongarra
, B. Tourancheau

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

8 Scopus citations

Abstract

In this paper, we make efficient use of asynchronous communications on the LU decomposition algorithm with pivoting and a column-scattered data decomposition to derive precise computational complexities. We then compare these results with experiments on the Intel iPSC/860 and Paragon machines and show that very good performances can be obtained on a ring with asynchronous communications.

Original language	English
Pages (from-to)	157-169
Number of pages	13
Journal	Parallel processing letters
Volume	5
Issue number	2
DOIs	https://doi.org/10.1142/S012962649500014X
State	Published - 1995
Externally published	Yes

Access to Document

10.1142/S012962649500014X

Cite this

@article{a95adf38d941432e97d911a46e4c05f9,

title = "Performance study of LU factorization with low communication overhead on multiprocessors",

abstract = "In this paper, we make efficient use of asynchronous communications on the LU decomposition algorithm with pivoting and a column-scattered data decomposition to derive precise computational complexities. We then compare these results with experiments on the Intel iPSC/860 and Paragon machines and show that very good performances can be obtained on a ring with asynchronous communications.",

author = "F. Desprez and Dongarra, \{J. J.\} and B. Tourancheau",

year = "1995",

doi = "10.1142/S012962649500014X",

language = "English",

volume = "5",

pages = "157--169",

journal = "Parallel processing letters",

issn = "0129-6264",

publisher = "World Scientific Publishing",

number = "2",

}

TY - JOUR

T1 - Performance study of LU factorization with low communication overhead on multiprocessors

AU - Desprez, F.

AU - Dongarra, J. J.

AU - Tourancheau, B.

PY - 1995

Y1 - 1995

N2 - In this paper, we make efficient use of asynchronous communications on the LU decomposition algorithm with pivoting and a column-scattered data decomposition to derive precise computational complexities. We then compare these results with experiments on the Intel iPSC/860 and Paragon machines and show that very good performances can be obtained on a ring with asynchronous communications.

AB - In this paper, we make efficient use of asynchronous communications on the LU decomposition algorithm with pivoting and a column-scattered data decomposition to derive precise computational complexities. We then compare these results with experiments on the Intel iPSC/860 and Paragon machines and show that very good performances can be obtained on a ring with asynchronous communications.

UR - https://www.scopus.com/pages/publications/0029312016

U2 - 10.1142/S012962649500014X

DO - 10.1142/S012962649500014X

M3 - Article

AN - SCOPUS:0029312016

SN - 0129-6264

VL - 5

SP - 157

EP - 169

JO - Parallel processing letters

JF - Parallel processing letters

IS - 2

ER -

Performance study of LU factorization with low communication overhead on multiprocessors

Abstract

Access to Document

Other files and links

Fingerprint

Cite this