ParallelProgramminginCwithMPISorting文件材料.ppt

Hyperquicksort 0, 8, 12, 15 19, 20, 21, 22, 40, 47, 47, 50, 54, 54 61, 64, 65, 66, 66, 67, 70, 72, 75, 82 83, 85, 86, 88, 89, 91, 98, 99 P0 P1 P2 P3 After exchange-and-merge step Complexity Analysis Assumptions Average-case analysis Lists stay reasonably balanced Communication time dominated by message transmission time, rather than message latency Complexity Analysis Initial quicksort step has time complexity ?((n/p) log (n/p)) Total comparisons needed for log p merge steps: ?((n/p) log p) Total communication time for log p exchange steps: ?((n/p) log p) Isoefficiency Analysis Sequential time complexity: ?(n log n) Parallel overhead: ?(n log p) Isoefficiency relation:n log n ? C n log p ? log n ? C log p ? n ? pC The value of C determines the scalability. Scalability depends on ratio of communication speed to computation speed. Another Scalability Concern Our analysis assumes lists remain balanced As p increases, each processor’s share of list decreases Hence as p increases, likelihood of lists becoming unbalanced increases Unbalanced lists lower efficiency Would be better to get sample values from all processes before choosing median Copyright ? The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Copyright ? The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programmingin C with MPI and OpenMP Michael J. Quinn Chapter 14 Sorting Sequential Quicksort 17 14 65 4 22 63 11 Choose pivot value Sequential Quicksort 17 14 65 4 22 63 11 Low list (? 17) High list ( 17) Sequential Quicksort 17 4 65 11 22 63 14 Recursively apply quicksort to low list Sequential Quicksort 17 4 22 11 63 65 14 Recursively apply quicksort to high list Sequential Quicksort 17 4 22 11 63 65 14 Sorted list of values 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