This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Median Splitting and k-Splitting with Application to Merging and Sorting
May 1993 (vol. 4 no. 5)
pp. 559-565

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.

[1] S. G. Akl and N. Santoro, "Optimal parallel merging and sorting without memory conflicts,"IEEE Trans. Comput., vol. C-36, pp. 1367-1369, 1987.
[2] Selim G. Akl,The Design and Analysis of Parallel Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[3] R. Cole, "Parallel merge sort,"SIAM J. Comput., vol. 17, pp. 770-785, 1988.
[4] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[5] C. P. Kruskal, "Searching, merging, and sorting in parallel computation,"IEEE Trans. Comput., vol. C-32, no. 10, pp. 942-946, Oct. 1983.
[6] M. Rodeh, "Finding the median distributively,"J. Comput. Syst. Sci., vol. 24, pp. 162-166, 1982.
[7] Y. Shiloach and U. Vishkin, "Finding the maximum, merging, and sorting in a parallel computation model,"J. Algorithms, vol. 2, pp. 88-102, 1981.
[8] J. L. Peterson and A. Silberschaz,Operating Systems Concepts. Reading, MA: Addison-Wesley, 1986.
[9] L. G. Valiant, "Parallelism in comparison problems,"SIAM J. Comput., vol. 4, no. 3, pp. 348-355, Sept. 1975.
[10] P. J. Varman, B. R. Iyer, D. J. Haderle, and S. M. Dunn, "Parallel merging: Algorithm and implementation results,"Parallel Comput., vol. 15, pp. 165-177, 1990.
[11] R. Xiong, "Design of parallel mergesort and quicksort algorithms," Ph.D. dissertation, Computer Science of C.U.N.Y., May 1990.

Index Terms:
Index Termsk-splitting; merging; sorting; median splitting; parallel splitting; parallel algorithms; sorting
Citation:
R. Xiong, T. Brown, "Parallel Median Splitting and k-Splitting with Application to Merging and Sorting," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 5, pp. 559-565, May 1993, doi:10.1109/71.224218
Usage of this product signifies your acceptance of the Terms of Use.