Randomized Parallel Computation (0)
| Venue: | Concurrent Computations - Algorithms, Architecture, and Technology. Proc. 1987 Princeton Workshop on Algorithms, Architecture and Technology Issues for Models of Concurrent Computation |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Rajasekaran_randomizedparallel,
author = {Sanguthevar Rajasekaran and John H. Reif},
title = {Randomized Parallel Computation},
booktitle = {Concurrent Computations - Algorithms, Architecture, and Technology. Proc. 1987 Princeton Workshop on Algorithms, Architecture and Technology Issues for Models of Concurrent Computation},
year = {},
pages = {181--202},
publisher = {Plenum Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The scope of this paper is to survey randomized parallel algorithms available for various computational problems. We do not claim to give a comprehensive list of all the randomized parallel algorithms that have been discovered so far. We only discuss representative examples which demonstrate the special features of both randomization and parallelization. The areas of CS we consider are: 1) routing and sorting, 2) processor load balancing, 3) algebra, and 4) graph theory. We also discuss in this paper various ways of derandomizing randomized parallel algorithms.
