This Article 
 Bibliographic References 
 Add to: 
A Benchmark Parallel Sort for Shared Memory Multiprocessors
December 1988 (vol. 37 no. 12)
pp. 1619-1626
The first parallel sort algorithm for shared memory MIMD (multiple-instruction-multiple-data-stream) multiprocessors that has a theoretical and measured speedup near linear is exhibited. It is based on a novel asynchronous parallel merge that evenly partitions data to be merged among any number of processors. A benchmark sorting algorithm is proposed that uses this merge to remove the linear ti

[1] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS Spring Joint Comput. Conf., Vol. 32, Atlantic City, NJ, 1968, pp. 307-314.
[2] G. Bauder and D. Stevenson, "Optimal sorting algorithms for parallel computers,"IEEE Trans. Comput., vol. C-27, pp. 84-87, Jan. 1978.
[3] D. Bitton, D. J. Dewitt, D. K. Hsiao, and J. Menon, "A taxonomy of parallel sorting,"Comput. Surveys, vol. 16, pp. 287-318, 1984.
[4] J. Deminet, "Experience with multiprocessor algorithms,"IEEE Trans. Comput., vol. C-31, pp. 278-288, Apr. 1982.
[5] M. Dubois, F. A. Briggs, I. Patil, and M. Balakrishnan, "Performance analysis of parallel quicksort in shared-memory multiprocessors," private communication, Jan. 1988.
[6] D. J. Evans and Y. Yousif, "Analysis of the peformance of the parallel quicksort method,"BIT, vol. 25, pp. 106-112, 1985.
[7] D. J. Evans and Y. Yousif, "The parallel neighbour sort and 2-way merge algorithm,"Parallel Comput., vol. 3, pp. 85-90, Mar. 1986.
[8] F. Gavril, "Merging with parallel processors,"Commun. ACM, vol. 18, pp. 588-591, Oct. 1975.
[9] D. Gries,The Science of Programming. New York: Springer-Verlag, 1981.
[10] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[11] S. Lakshmivarahan, S. K. Dhall and L. L. Miller, "Parallel sorting algorithms," inAdvances in Computers, Vol. 13. New York: Academic, 1984, pp. 295-354.
[12] I. D. Mathieson and R. S. Francis, "A dynamic-trace-driven simulator for evaluating parallelism," inProc. 21st Hawaii Int. Conf. Syst. Sci. Vol. 1 (Architecture Track), Kailua-Kona, HI, Jan. 1988, pp. 158-166.
[13] P. Moller-Nielson and J. Staunstrup, "Problem-heap: A paradigm for multiprocessor algorithms,"Parallel Comput., vol. 4, pp. 63-74, Feb. 1987.
[14] D. E. Muller and F. P. Preparata, "Bounds to complexities of networks for sorting and switching,"J. ACM, vol. 22, no. 2, Apr. 1975.
[15] F. P. Preparata, "New paraIlel sorting schemes,"IEEE Trans. Comput., vol. C-27, pp. 669-673, July 1978.
[16] W. Ronsch and H. Strauss, "Timing results of some internal sorting algorithms on vector computers,"Parallel Computing, vol. 4, pp. 49-61, Feb. 1987.
[17] R. Sedgewick, "Implementing quicksort programs,"Commun. ACM, vol. 21, pp. 847-856, Oct. 1978.
[18] L. G. Valiant, "Parallelism in comparison problems,"SIAM J. Comput., vol. 4, pp. 348-355, Sept. 1975.

Index Terms:
benchmark; parallel sort; shared memory multiprocessors; sort algorithm; MIMD; multiprocessors; Sequent Balance 21000 System; computer testing; parallel algorithms; sorting.
R.S. Francis, I.D. Mathieson, "A Benchmark Parallel Sort for Shared Memory Multiprocessors," IEEE Transactions on Computers, vol. 37, no. 12, pp. 1619-1626, Dec. 1988, doi:10.1109/12.9738
Usage of this product signifies your acceptance of the Terms of Use.