Communication-efficient parallel generic pairwise elimination

Authors:
Alexander Tiskin
Affiliations:
Department of Computer Science, University of Warwick, Coventry, United Kingdom
Venue:
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Year:
2007

Citing 19
Cited 3

Introduction to Parallel & Vector Solution of Linear Systems

Introduction to Parallel & Vector Solution of Linear Systems
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Communication complexity of PRAMs

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Parallel algorithms for dense linear algebra computations

SIAM Review
A bridging model for parallel computation

Communications of the ACM
Average-case stability of Gaussian elimination

SIAM Journal on Matrix Analysis and Applications
Total positivity, QR factorization, and Neville elimination

SIAM Journal on Matrix Analysis and Applications
Optimal algorithms for parallel Givens factorization on a coarse-grained PRAM

Journal of the ACM (JACM)
A BSP realisation of Strassen's algorithm

Abstract machine models for parallel and distributed computing
Locality of Reference in LU Decomposition with Partial Pivoting

SIAM Journal on Matrix Analysis and Applications
On Stable Parallel Linear System Solvers

Journal of the ACM (JACM)
Parallel Algorithms and Matrix Computation

Parallel Algorithms and Matrix Computation
New Parallel Algorithms for Direct Solution of Linear Equations

New Parallel Algorithms for Direct Solution of Linear Equations
Finite field linear algebra subroutines

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Parallel Scientific Computation: A Structured Approach Using BSP and MPI

Parallel Scientific Computation: A Structured Approach Using BSP and MPI
FFPACK: finite field linear algebra package

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Pipeline Givens sequences for computing the QR decomposition on a EREW PRAM

Parallel Computing
A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F2

Computing
Algebraic Complexity Theory

Algebraic Complexity Theory

Bulk synchronous parallel ML with exceptions

Future Generation Computer Systems
Growth factors of pivoting strategies associated with Neville elimination

Journal of Computational and Applied Mathematics
Graph expansion and communication costs of fast matrix multiplication

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.