CS267: Lecture 21


November 7, 2001

Lecturer: Kathy Yelick


We given and overview of the LopP model for parallel algorithm analysis and use it model parallel sorting algorithms.  Experimental data from implementations of these algorithms is also presented and compared to the model.  Overall, the model predicts the performance to within about 10% of actual performance.  

2001 Lecture Notes

PowerPoint, Postscript, PDF


  • Jim Gray's Sorting Benchmarks page
  • Fast Parallel Sorting under LogP: Experience with the CM-5
  • Searching for the Sorting Record: Experiences in Tuning NOW-Sort