By Topic

Parallel sorting on a shared-nothing architecture using probabilistic splitting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
DeWitt, D.J. ; Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA ; Naughton, J.F. ; Schneider, D.A.

The authors consider the problem of external sorting in a shared-nothing multiprocessor. A critical step in the algorithms the authors consider is to determine the range of sort keys to be handled by each processor. They consider two techniques for determining these ranges of sort keys: exact splitting, using a parallel version of the algorithm proposed by Iyer, Ricard, and Varman; and probabilistic splitting, which uses sampling to estimate quantiles. They present analytic results showing that probabilistic splitting performs better than exact splitting. Finally, the authors present experimental results from an implementation of sorting probabilistic splitting in the Gamma parallel database machine

Published in:

Parallel and Distributed Information Systems, 1991., Proceedings of the First International Conference on

Date of Conference:

4-6 Dec 1991