The Community for Technology Leaders
Green Image
<p>Multiple-instruction multiple-data (MIMD) algorithms that use multiple processors to domedian splitting, k-splitting and parallel splitting into t equal sections are presented. Bothconcurrent 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 easilyconverted into a median-splitting problem. Methods for finding multiple split points quickly and application of k-splitting to merging and sorting are discussed.</p>
Index Termsk-splitting; merging; sorting; median splitting; parallel splitting; parallel algorithms; sorting
T. Brown, R. Xiong, "Parallel Median Splitting and k-Splitting with Application to Merging and Sorting", IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 559-565, May 1993, doi:10.1109/71.224218
95 ms
(Ver 3.3 (11022016))