Skip to main content
Log in

Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

We analyze the computational and communication complexity of four sorting algorithms as implemented on a hypercube multicomputer: two variants of hyperquicksort and two variants of quickmerge. Based upon this analysis, machine-specific parameters can be used to determine when each algorithm requires less communication time than the others. We present benchmark results of the four algorithms on a 64-processor NCube/7. The benchmarking provides experimental evidence that hyperquicksort divides the values to be sorted more evenly among the processors than quickmerge. Because it does a better job balancing work between processors, hyperquicksort proves to be uniformly superior to quickmerge.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. Dekel, D. Nassimi, and S. Sahni,Parallel matrix and graph algorithms, SIAM Journal on Computing, Vol. 10, No. 4, November 1981, pp. 657–675.

    Google Scholar 

  2. M. J. Quinn,Designing Efficient Algorithms for Parallel Computers, McGraw-Hill, 1987.

  3. M. J. Quinn,Parallel sorting algorithms for tightly coupled multiprocessors, Parallel Computing, Vol. 6, 1988, pp. 349–357.

    Google Scholar 

  4. R. Sedgewick,Implementing quicksort programs, Communications of the ACM, Vol. 21, No. 10, October 1978, pp. 847–857.

    Google Scholar 

  5. S. R. Seidel and L. R. Ziegler,Sorting on hypercubes, in Hypercube Multiprocessors 1987, M. T. Heath, ed., SIAM Press, 1987, pp. 285–291.

  6. S. J. Sulsky,Hypercube implementations for the solution of linear systems of equations, M. S. thesis, Dept. of Computer Science, Univ. of New Hampshire, 1987.

  7. B. Wagar,Hyperquicksort — A fast sorting algorithm for hypercubes, in Hypercube Multiprocessors 1987, M. T. Heath, ed., SIAM Press, 1987, pp. 292–299.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Quinn, M.J. Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge. BIT 29, 239–250 (1989). https://doi.org/10.1007/BF01952679

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01952679

CR Categories

Keywords

Navigation