Space and Time Efficient Implementations of Parallel Nested Dissection (1992)
| Venue: | PROC. SPAA'92 |
| Citations: | 5 - 3 self |
BibTeX
@INPROCEEDINGS{Armon92spaceand,
author = {Deganit Armon and John Reif},
title = {Space and Time Efficient Implementations of Parallel Nested Dissection},
booktitle = {PROC. SPAA'92},
year = {1992},
pages = {344--352},
publisher = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Nested dissection (ND) is a method for solving sparse n \Theta n linear systems efficiently by imposing an order of elimination on the variables. Parallel nested dissection (PND) algorithms, which do this variable elimination in parallel, have been developed for the PRAM model and for grid architectures. In this paper, we describe the following improvements to the known PND algorithms: 1. FAST PND: a fast PND algorithm for the PRAM model, which reduces the time bound by a factor of O(log n), without significantly increasing the processor bound. 2. COMPACT PND: a PND algorithm for a mesh-connected processor array, applicable to matrices representable by a grid graph, that uses O(n) processors and takes O( p n) time, and reduces the space bounds to a constant factor of the size of the input matrix, without significant increase in time or processor bounds. 3. GENERALIZED COMPACT PND: a PND algorithm for a mesh-connected processor array, that uses O(n) processors and takes O( p n) ti...
