Applying parallel computation algorithms in the design of serial algorithms (1983)
| Venue: | J. ACM |
| Citations: | 224 - 7 self |
BibTeX
@ARTICLE{Megiddo83applyingparallel,
author = {Nimrod Megiddo},
title = {Applying parallel computation algorithms in the design of serial algorithms},
journal = {J. ACM},
year = {1983},
volume = {30},
pages = {852--865}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. The goal of this paper is to point out that analyses of parallelism in computational problems have practical implications even when multiprocessor machines are not available. This is true because, in many cases, a good parallel algorithm for one problem may turn out to be useful for designing an efficient serial algorithm for another problem. A d ~ eframework d for cases like this is presented. Particular cases, which are discussed in this paper, provide motivation for examining parallelism in sorting, selection, minimum-spanning-tree, shortest route, max-flow, and matrix multiplication problems, as well as in scheduling and locational problems.
