Standard

Communication-efficient parallel generic pairwise elimination. / Tiskin, Alexander.

In: Future Generation Computer Systems, Vol. 23, No. 2, 01.02.2007, p. 179-188.

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

Harvard

Tiskin, A 2007, 'Communication-efficient parallel generic pairwise elimination', Future Generation Computer Systems, vol. 23, no. 2, pp. 179-188. https://doi.org/10.1016/j.future.2006.04.017

APA

Tiskin, A. (2007). Communication-efficient parallel generic pairwise elimination. Future Generation Computer Systems, 23(2), 179-188. https://doi.org/10.1016/j.future.2006.04.017

Vancouver

Tiskin A. Communication-efficient parallel generic pairwise elimination. Future Generation Computer Systems. 2007 Feb 1;23(2):179-188. https://doi.org/10.1016/j.future.2006.04.017

Author

Tiskin, Alexander. / Communication-efficient parallel generic pairwise elimination. In: Future Generation Computer Systems. 2007 ; Vol. 23, No. 2. pp. 179-188.

BibTeX

@article{99af48d241cf4fa99a7f40eb9775778e,
title = "Communication-efficient parallel generic pairwise 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 generic pairwise elimination, special cases of which include Gaussian elimination with pairwise pivoting, Gaussian elimination over a finite field, generic Neville elimination and Givens reduction. We develop a new block-recursive, communication-efficient BSP algorithm for generic pairwise elimination. {\textcopyright} 2006 Elsevier Ltd. All rights reserved.",
keywords = "Algebraic algorithms, Linear systems, Parallel algorithms",
author = "Alexander Tiskin",
year = "2007",
month = feb,
day = "1",
doi = "10.1016/j.future.2006.04.017",
language = "English",
volume = "23",
pages = "179--188",
journal = "Future Generation Computer Systems",
issn = "0167-739X",
publisher = "Elsevier",
number = "2",

}

RIS

TY - JOUR

T1 - Communication-efficient parallel generic pairwise elimination

AU - Tiskin, Alexander

PY - 2007/2/1

Y1 - 2007/2/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 generic pairwise elimination, special cases of which include Gaussian elimination with pairwise pivoting, Gaussian elimination over a finite field, generic Neville elimination and Givens reduction. We develop a new block-recursive, communication-efficient BSP algorithm for generic pairwise elimination. © 2006 Elsevier Ltd. All rights reserved.

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 generic pairwise elimination, special cases of which include Gaussian elimination with pairwise pivoting, Gaussian elimination over a finite field, generic Neville elimination and Givens reduction. We develop a new block-recursive, communication-efficient BSP algorithm for generic pairwise elimination. © 2006 Elsevier Ltd. All rights reserved.

KW - Algebraic algorithms

KW - Linear systems

KW - Parallel algorithms

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

U2 - 10.1016/j.future.2006.04.017

DO - 10.1016/j.future.2006.04.017

M3 - Article

AN - SCOPUS:33748541614

VL - 23

SP - 179

EP - 188

JO - Future Generation Computer Systems

JF - Future Generation Computer Systems

SN - 0167-739X

IS - 2

ER -

ID: 127711194