Skip to main content
SpringerLink
Log in

Analysis of the performance of the parallel quicksort method

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

Abstract

In this paper a theoretical analysis of the performance of a parallel form of the Quicksort algorithm is presented and shown to be in qualitative agreement with experiments carried out on the Loughborough University NEPTUNE parallel system.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barlow, R. H. and Evans, D. J.,An analysis of the performance of a dual-minicomputer parallel computer system, Internal Report No. 59, Computer Studies Dept., Loughborough University, 1977.

  2. Barlow R. H., Evans D. J., Newman I. A. and Woodward M. C.,A guide to using the NEPTUNE parallel processing system, Internal Report, Computer Studies Dept., Loughborough University, 1981.

  3. Evans, D. J. and Dunbar, R. C.,The parallel Quicksort algorithm, Part I — Run time analysis, Int. Jour. Comp. Math. 12, pp. 19–57.

  4. Evans, D. J. and Dunbar, R. C.,The parallel Quicksort algorithm, Part 2 — Simulation, Int. Jour. Comp. Math., 12 (1982), pp. 125–136.

    Google Scholar 

  5. Hoare, C. A. R.,Partition: Algorithm 63; Quicksort: Algorithm 64; and Find: Algorithm 65, Comm. of ACM, Vol. 4, No. 7 (1961), pp. 321–322.

    Article  Google Scholar 

  6. Hoare, C. A. R.,Quicksort, Comp. J. Vol. 5, (1962), pp. 10–15.

    Article  Google Scholar 

  7. Hoare, C. A. R.Algorithm 64, quicksort, Comm. ACM, Vol. 4, No. 7, (1961), pp. 321–322.

    Article  Google Scholar 

  8. Knuth, D. E.,The Art of Computer Programming: Vol. 3, Sorting and Searching, Addison-Wesley Publishing Company, Reading, Massachusetts, (1973).

    Google Scholar 

  9. Loser, R.,Some performance tests of Quicksort and descendants. Comm. ACM, Vol. 17, No. 3, (1974), pp. 143–152.

    Article  Google Scholar 

  10. Sedgewick, R.,Quicksort, Ph. D. Thesis, Stanford University, Stanford, California, May 1975.

    Google Scholar 

  11. Sedgewick, R.,The analysis of Quicksort programs, Acta Informatica, Vol. 7, Part 4 (1977) pp. 327–355.

    Article  Google Scholar 

  12. Sedgewick, R.,Implementing Quicksort program, CACM, Vol. 21, No. 10(1978), pp. 847–856. 847–856.

    Google Scholar 

  13. Yousif, Nadia Y.,Parallel algorithms for asynchronous multiprocessors, Ph.D. Thesis, University of Technology, Loughborough (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Studies, Loughborough University of Technology, LE 11 3TU, Loughborough, Leicestershire, England

    D. J. Evans & Nadia Y. Yousif

  2. Dept. of Computer Science, College of Science, Basrah University, Iraq

    D. J. Evans & Nadia Y. Yousif

Authors
  1. D. J. Evans
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nadia Y. Yousif
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Evans, D.J., Yousif, N.Y. Analysis of the performance of the parallel quicksort method. BIT 25, 106–112 (1985). https://doi.org/10.1007/BF01934992

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

CR categories

Search

Navigation