Performance study of LU factorization with low communication overhead on multiprocessors

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

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

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	12
Journal	Parallel Processing Letters
Volume	5
Issue number	2
Publication status	Published - Jun 1995

Access to Document

Cite this

@article{ab3646a5e62a409fb71664fa931cfd5a,

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",

month = jun,

language = "English",

volume = "5",

pages = "157--169",

journal = "Parallel Processing Letters",

issn = "1793-642X",

publisher = "World Scientific Publishing Co. Pte. Ltd",

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/6

Y1 - 1995/6

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.

M3 - Article

SN - 1793-642X

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

Fingerprint

Cite this