Parallel Programming in C with MPI Sorting参考.ppt

Parallel Programmingin C with MPI and OpenMP Michael J. Quinn Chapter 14 Sorting Outline Sorting problem Sequential quicksort Parallel quicksort Hyperquicksort Parallel sorting by regular sampling Sorting Problem Permute: unordered sequence ? ordered sequence Typically key (value being sorted) is part of record with additional values (satellite data) Most parallel sorts designed for theoretical parallel models: not practical Our focus: internal sorts based on comparison of keys Sequential Quicksort Sequential Quicksort Sequential Quicksort Sequential Quicksort Sequential Quicksort Sequential Quicksort Attributes of Sequential Quicksort Average-case time complexity: ?(n log n) Worst-case time complexity: ?(n2) Occurs when low, high lists maximally unbalanced at every partitioning step Can make worst-case less probable by using sampling to choose pivot value Example: “Median of 3” technique Quicksort Good Starting Point for Parallel Algorithm Speed Generally recognized as fastest sort in average case Preferable to base parallel algorithm on fastest sequential algorithm Natural concurrency Recursive sorts of low, high lists can be done in parallel Definitions of “Sorted” Definition 1: Sorted list held in memory of a single processor Definition 2: Portion of list in every processor’s memory is sorted Value of last element on Pi’s list is less than or equal to value of first element on Pi+1’s list We adopt Definition 2: Allows problem size to scale with number of processors Parallel Quicksort Parallel Quicksort Parallel Quicksort Parallel Quicksort Parallel Quicksort Parallel Quicksort Parallel Quicksort Parallel Quicksort Analysis of Parallel Quicksort Execution time dictated by when last process completes Algorithm likely to do a poor job balancing number of elements sorted by each process Cannot expect pivot value to be true median Can choose a better pivot value Hyperquicksort Start where parallel quicksort ends: each process sorts its sublist First “sortedness” co