Communication-Efficient Parallel Generic Pairwise Elimination
Tiskin, A. (2007) Communication-Efficient Parallel Generic Pairwise Elimination. Future Generation Computer Systems, 23 (2). pp. 179-188. ISSN 0167-739X
![[img]](http://eprints.dcs.warwick.ac.uk/style/images/fileicons/application_pdf.png) | PDF - Published Version Restricted to Repository staff only Download (678Kb) |
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | focs parallel algorithms algebraic algorithms linear systems |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science > Computer Science |
| Depositing User: | Ms Saima Arif |
| Date Deposited: | 03 Dec 2010 15:19 |
| Last Modified: | 26 Jul 2011 12:15 |
| URI: | http://eprints.dcs.warwick.ac.uk/id/eprint/414 |
Actions (login required)
| View Item |
