并行程序设计 Chapter4要点.ppt

CHAPTER 4 Partitioning and Divide-and-Conquer Strategies 4.1 Partitioning 划分 1. 划分策略 Partitioning Strategies 2. 分治 Divide and Conquer 3. M维树状分治 M-ary Divide and Conquer 4.2 Examples 1. Sorting Using Bucket Sort 2. Numerical Integration 3. N-Body Problem 4.1 Partitioning Partitioning simply divided the problem into separate parts and each part is computed separately. Divide and Conquer is characterized by dividing problem into subproblems of same form as larger problem. Further divisions into still smaller sub-problems,usually done by recursion. 4.1.1 Partitioning Strategi