Paper Info
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.
Year
DOI
Venue
2007
10.1016/j.future.2006.04.017
Future Generation Comp. Syst.
Keywords
Field
DocType
algebraic algorithms,bulk-synchronous parallel,pairwise pivoting,givens reduction,generic pairwise elimination,parallel algorithms,communication-efficient bsp algorithm,communication-efficient parallel generic pairwise,generic neville elimination,parallel complexity,finite field,gaussian elimination,linear systems,general-purpose parallel computing,parallel computer,bulk synchronous parallel,parallel algorithm,linear system
Pairwise comparison,Finite field,Linear system,Parallel algorithm,Computer science,Parallel computing,Gaussian elimination,Bulk synchronous parallel,Tridiagonal matrix algorithm,Computation,Distributed computing
Journal
Volume
Issue
ISSN
23
2
Future Generation Computer Systems
Citations 
PageRank 
References 
12
0.74
13
Authors
1
Name
Order
Citations
PageRank
Alexander Tiskin122015.50