An improved, randomized algorithm for parallel selection with an experimental study

A common statistical problem is that of finding the median element in a set of data. This paper presents an efficient randomized high-level parallel algorithm for finding the median given a set of elements distributed across a parallel machine. In fact, our algorithm solves the general selection pro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of parallel and distributed computing Ročník 64; číslo 9; s. 1051 - 1059
Hlavný autor: Bader, David A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: San Diego, CA Elsevier Inc 01.09.2004
Elsevier
Predmet:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Experimental parallel algorithmics
Parallel algorithms
Randomized algorithms
Selection algorithm
Software
Theoretical computing
Selection algorithm
Randomized algorithms
Experimental parallel algorithmics
Parallel algorithms
Parallel algorithm
Scalability
Task scheduling
Parallel machines
Randomized algorithm
Distributed memory
Selection problem
Communicating process
Message passing
Algorithm performance
ISSN:0743-7315, 1096-0848
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A common statistical problem is that of finding the median element in a set of data. This paper presents an efficient randomized high-level parallel algorithm for finding the median given a set of elements distributed across a parallel machine. In fact, our algorithm solves the general selection problem that requires the determination of the element of rank k, for an arbitrarily given integer k. Our general framework is an SPMD distributed-memory programming model that is enhanced by a set of communication primitives. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. The algorithms have been coded in the message-passing standard MPI, and our experimental results from the IBM SP-2 illustrate the scalability and efficiency of our algorithm and improve upon all the related experimental results known to the author. The main contributions of this paper are (1) New techniques for speeding the performance of certain randomized algorithms, such as selection, which are efficient with likely probability. (2) A new, practical randomized selection algorithm (UltraFast) with significantly improved convergence.
ISSN:0743-7315
1096-0848
DOI:10.1016/j.jpdc.2004.06.010