Architecture independent parallel selection with applications to parallel priority queues

Authors:
Alexandros V. Gerbessiotis;Constantinos J. Siniolakis
Affiliations:
CIS Department, New Jersey Institute of Technology, Newark, NJ;The American College of Greece, 6 Gravias St. Aghia Paraskevi, Athens, 15342, Greece
Venue:
Theoretical Computer Science
Year:
2003

Citing 25
Cited 2

Concurrent Access of Priority Queues

IEEE Transactions on Computers
A randomized parallel branch-and-bound procedure

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Concurrent operations on priority queues

Communications of the ACM
A bridging model for parallel computation

Communications of the ACM
Introduction to algorithms

Introduction to algorithms
General purpose parallel architectures

Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Parallel priority queues

Information Processing Letters
Parallel heap: an optimal parallel priority queue

The Journal of Supercomputing
Randomized parallel algorithms for backtrack search and branch-and-bound computation

Journal of the ACM (JACM)
Direct bulk-synchronous parallel algorithms

Journal of Parallel and Distributed Computing
Deterministic sorting and randomized median finding on the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Practical considerations of parallel simulations and architecture independent parallel algorithm design

Journal of Parallel and Distributed Computing
A Unified Lower Bound for Selection and Set Partitioning Problems

Journal of the ACM (JACM)
Parallel permutation and sorting algorithms and a new generalized connection network

Journal of the ACM (JACM)
Priority queues on parallel machines

Parallel Computing
Selecting the Median

SIAM Journal on Computing
Expected time bounds for selection

Communications of the ACM
Median Selection Requires $(2+\epsilon)n$ Comparisons

SIAM Journal on Discrete Mathematics
Parallel Priority Queue and List Contraction: The BSP Approach

Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP Model

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Randomized Parallel Selection

Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Fast Priority Queues for Parallel Branch-and-Bound

IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
Average case selection

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Parallel selection by regular sampling

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Recursive design of hardware priority queues

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	5.23

Visualization

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.