Parallel priority queue and list contraction: The BSP approach

Authors

Alexandros V. Gerbessiotis, New Jersey Institute of Technology
Constantinos J. Siniolakis, The American College of Greece
Alexandre Tiskin, Faculty of Science, Engineering and Medicine

Document Type

Article

Publication Date

1-1-2002

Abstract

In this work we present efficient and practical randomized data structures on the Bulk-Synchronous Parallel (BSP) model of computation along with an experimental study of their performance. In particular, we study data structures for the realization of Parallel Priority Queues (PPQs). We show that our algorithms are communication efficient and achieve optimality to within small multiplicative constant factors for a wide range of parallel machines. We also present an experimental study of our PPQ algorithms on a Cray T3D. Finally, we present new randomized and deterministic BSP algorithms for list and tree contraction.

Identifier

0346677541 (Scopus)

Publication Title

Computing and Informatics

ISSN

13359150

First Page

59

Last Page

90

Issue

1

Volume

21

Recommended Citation

Gerbessiotis, Alexandros V.; Siniolakis, Constantinos J.; and Tiskin, Alexandre, "Parallel priority queue and list contraction: The BSP approach" (2002). Faculty Publications. 14987.
https://digitalcommons.njit.edu/fac_pubs/14987