Parallelized QuickSort with Optimal Speedup

@inproceedings{Powers1991ParallelizedQW,
  title={Parallelized QuickSort with Optimal Speedup},
  author={David M. W. Powers},
  year={1991}
}
Knuth (1973,pp2-3) notes that sorting is estimated to take up 25% of the world’s computer time. With the advent of the microcomputer this may well have changed, but it is nonetheless a both practically and theoretically interesting task. Sorting, in the sense of bringing together related things, has now been subsumed by.the more specific task of ordering, and has spawned an enormous number of serial sorting algorithms. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
5 Extracted Citations
9 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-9 of 9 references

Parallelism in QuickSort

  • R S FRANCIS, L J H PANNAN
  • Proc. 12th Aust. Comp. Sci. Conf
  • 1989
1 Excerpt

Implementing Connection Graphs for Logic Programming

  • D M W POWERS
  • Proc. 9th European Meeting on Cybernetics, Vienna
  • 1988
1 Excerpt

Sorting in c log n parallel steps

  • J K OMLÓS
  • 1983

Sorting Networks and their Applications

  • K E B ATCHER
  • 1968

A R (1962): QuickSort

  • C HOARE
  • Computer Journal ,
  • 1962

Similar Papers

Loading similar papers…