Standard

Communication-efficient parallel Gaussian elimination. / Tiskin, Alexander.

Parallel Computing Technologies (PaCT 2003). 2003. p. 369-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2763).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Tiskin, A 2003, Communication-efficient parallel Gaussian elimination. in Parallel Computing Technologies (PaCT 2003). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2763, pp. 369-383. https://doi.org/10.1007/978-3-540-45145-7_35

APA

Tiskin, A. (2003). Communication-efficient parallel Gaussian elimination. In Parallel Computing Technologies (PaCT 2003) (pp. 369-383). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2763). https://doi.org/10.1007/978-3-540-45145-7_35

Vancouver

Tiskin A. Communication-efficient parallel Gaussian elimination. In Parallel Computing Technologies (PaCT 2003). 2003. p. 369-383. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-45145-7_35

Author

Tiskin, Alexander. / Communication-efficient parallel Gaussian elimination. Parallel Computing Technologies (PaCT 2003). 2003. pp. 369-383 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{f108e908fafa44ccaf7495e4272c1108,
title = "Communication-efficient parallel Gaussian elimination",
abstract = "The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of two matrix problems: Gaussian elimination with pairwise pivoting, and orthogonal matrix decomposition by Givens rotations. We define a common framework that unifies both problems, and present a new communication-efficient BSP algorithm for their solution. Apart from being a useful addition to the growing collection of efficient BSP algorithms, our result can be viewed as a refinement of the classical {"}parallelism-communication tradeoff{"}. {\textcopyright} Springer-Verlag Berlin Heidelberg 2003.",
author = "Alexander Tiskin",
year = "2003",
month = jan,
day = "1",
doi = "10.1007/978-3-540-45145-7_35",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "369--383",
booktitle = "Parallel Computing Technologies (PaCT 2003)",

}

RIS

TY - GEN

T1 - Communication-efficient parallel Gaussian elimination

AU - Tiskin, Alexander

PY - 2003/1/1

Y1 - 2003/1/1

N2 - The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of two matrix problems: Gaussian elimination with pairwise pivoting, and orthogonal matrix decomposition by Givens rotations. We define a common framework that unifies both problems, and present a new communication-efficient BSP algorithm for their solution. Apart from being a useful addition to the growing collection of efficient BSP algorithms, our result can be viewed as a refinement of the classical "parallelism-communication tradeoff". © Springer-Verlag Berlin Heidelberg 2003.

AB - The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. In this paper, we consider the parallel complexity of two matrix problems: Gaussian elimination with pairwise pivoting, and orthogonal matrix decomposition by Givens rotations. We define a common framework that unifies both problems, and present a new communication-efficient BSP algorithm for their solution. Apart from being a useful addition to the growing collection of efficient BSP algorithms, our result can be viewed as a refinement of the classical "parallelism-communication tradeoff". © Springer-Verlag Berlin Heidelberg 2003.

UR - http://www.scopus.com/inward/record.url?scp=35248895922&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-45145-7_35

DO - 10.1007/978-3-540-45145-7_35

M3 - Conference contribution

AN - SCOPUS:35248895922

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 369

EP - 383

BT - Parallel Computing Technologies (PaCT 2003)

ER -

ID: 127756864