LoboVault Home

An Improved Randomized Selection Algorithm With an Experimental Study

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/59

An Improved Randomized Selection Algorithm With an Experimental Study

Show full item record

Title: An Improved Randomized Selection Algorithm With an Experimental Study
Author: Bader, D.A.
Subject: Selection Algorithm
Randomized Algorithms
Parallel Algorithms
Experimental Parallel Algorithmics
Abstract: 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 algorithms 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 authors.
Date: 1999-09
Series: EECE-TR-99-005
Description: Technical Report
URI: http://hdl.handle.net/1928/59


Files in this item

Files Size Format View
EECE-TR-99-005.pdf 86.72Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record

UNM Libraries

Search LoboVault


Browse

My Account