Parallel Priority Queue and List Contraction: The BSP Approach (1997)
| Venue: | In Proc. Euro-Par 97. LNCS |
| Citations: | 5 - 0 self |
BibTeX
@INPROCEEDINGS{Gerbessiotis97parallelpriority,
author = {Alexandros V. Gerbessiotis and Ros V. Gerbessiotis and Alexandre Tiskin and Constantinos J. Siniolakis and Re Tiskin},
title = {Parallel Priority Queue and List Contraction: The BSP Approach},
booktitle = {In Proc. Euro-Par 97. LNCS},
year = {1997},
pages = {409--416},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. In this paper we present efficient and practical extensions of the randomized Parallel Priority Queue (PPQ) algorithms of Ranade et al., and efficient randomized and deterministic algorithms for the problem of list contraction on the Bulk-Synchronous Parallel (BSP) model. We also present an experimental study of their performance. We show that our algorithms are communication efficient and achieve small multiplicative constant factors for a wide range of parallel machines. 1 Introduction We present an architecture independent study of the computation and communication requirements of an efficient Parallel Priority Queue (PPQ) implementation and list contraction algorithms along with an experimental study. The computational model adopted is the Bulk-Synchronous Parallel (BSP) model, proposed by L. G. Valiant [20], which deals explicitly with the notion of communication and synchronization among computational threads. A detailed discussion of the BSP model appears in [20]. The first a...
