Parallel Priority Queue and List Contraction: The BSP Approach
AbstractIn 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.
Download data is not yet available.
How to Cite
Gerbessiotis, A. V., Siniolakis, C. J., & Tiskin, A. (2012). Parallel Priority Queue and List Contraction: The BSP Approach. COMPUTING AND INFORMATICS, 21(1), 59–90. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/505