CS267: Lecture 28, Apr 29 1999

Parallel Sorting

Abstract

We present a lecture of David Culler's comparing different parallel sorting algorithms on the CM-5, with their performance modeled using LogP.

Lecture Notes

  • Power Point version
  • Postscript version
  • Primary Readings

  • Fast Parallel Sorting under LogP: Experience with the CM-5
  • Secondary Readings

  • Searching for the Sorting Record: Experiences in Tuning NOW-Sort