By Topic

Parallel median splitting and k-splitting with application to merging and sorting

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
$33 $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

2 Author(s)
Xiong, R. ; Dept. of Math. & Comput. Sci., Edinboro Univ. of Pennsylvania, PA, USA ; Brown, T.

Multiple-instruction multiple-data (MIMD) algorithms that use multiple processors to do median splitting, k-splitting and parallel splitting into t equal sections are presented. Both concurrent read, exclusive write (CREW) and exclusive read, exclusive write (EREW) versions of the algorithms are given. It is shown that a k-splitting problem can be easily converted into a median-splitting problem. Methods for finding multiple split points quickly and application of k-splitting to merging and sorting are discussed

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:4 ,  Issue: 5 )