DOI

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.
Язык оригиналаанглийский
Название основной публикацииEuro-Par'97 Parallel Processing (Euro-Par 1997)
Страницы409-416
Число страниц8
DOI
СостояниеОпубликовано - 1 янв 1997

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ИздательSpringer Nature
Том1300
ISSN (печатное издание)0302-9743

ID: 127724823