The Library
Communication-efficient parallel generic pairwise elimination
Tools
Tools
Tools
Tiskin, Alexander. (2007) Communication-efficient parallel generic pairwise elimination. Future Generation Computer Systems, Vol.23 (No.2). pp. 179-188. ISSN 0167-739X
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.future.2006.04.017
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. (c) 2006 Elsevier B.V. All rights reserved.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Divisions: | Faculty of Science > Computer Science |
| Journal or Publication Title: | Future Generation Computer Systems |
| Publisher: | Elsevier Science BV |
| ISSN: | 0167-739X |
| Date: | February 2007 |
| Volume: | Vol.23 |
| Number: | No.2 |
| Number of Pages: | 10 |
| Page Range: | pp. 179-188 |
| Identification Number: | 10.1016/j.future.2006.04.017 |
| Status: | Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Restricted or Subscription Access |
| URI: | http://wrap.warwick.ac.uk/id/eprint/32970 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
