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.
Cite
CITATION STYLE
Gerbessiotis, A. V., Siniolakis, C. J., & Tiskin, A. (1997). Parallel priority queue and list contraction: The BSP approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 409–416). Springer Verlag. https://doi.org/10.1007/bfb0002764
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
