Architecture independent parallel selection with applications to parallel priority queues

Document Type

Article

Publication Date

5-14-2003

Abstract

We present a randomized selection algorithm whose performance is analyzed in an architecture independent way on the bulk-synchronous parallel (BSP) model of computation along with an application of this algorithm to dynamic data structures, namely parallel priority queues. We show that our algorithms improve previous results upon both the communication requirements and the amount of parallel slack required to achieve optimal performance. We also establish that optimality to within small multiplicative constant factors can be achieved for a wide range of parallel machines. While these algorithms are fairly simple themselves, descriptions of their performance in terms of the BSP parameters is somewhat involved; the main reward of quantifying these complications is that it allows transportable software to be written for parallel machines that fit the model. © 2002 Elsevier Science B.V. All rights reserved.

Identifier

0038709729 (Scopus)

Publication Title

Theoretical Computer Science

External Full Text Location

https://doi.org/10.1016/S0304-3975(02)00572-8

ISSN

03043975

First Page

119

Last Page

142

Issue

1-3

Volume

301

This document is currently not available here.

Share

COinS