1. Partitioning & Divide and Conquer Strategies Prof. Wenwen Li School of Geographical Sciences and Urban Planning 5644 Coor Hall wenwen@asu.edu

2. Outline 1. Partitioning Strategies 2. Divide and Conquer Strategies 3. Examples 4. Applications 5. Summary

3. Partitioning Strategies Partitioning divides a complex problem into parts. Data division: data partitioning or domain decomposition Program division: functional decomposition

4. Partitioning Strategies Types of partitioning* Single-level partitioning: Range partitioning: maps data to partitions based on ranges of values of the partitioning key that you establish for each partition. Hash partitioning: maps data to partitions based on a hashing algorithm. List partitioning: enables explicitly controlling how rows map to partitions by specifying a list of discrete values for the partitioning key in the description for each partition. * http://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htmhttp://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htm

5. Partitioning Strategies Types of partitioning* Single-level partitioning: * http://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htmhttp://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htm

6. Partitioning Strategies Types of partitioning* Composite partitioning: Composite Range-Range Partitioning Composite Range-Hash Partitioning Composite Range-List Partitioning Composite List-Range Partitioning Composite List-Hash Partitioning Composite List-List Partitioning * http://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htmhttp://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htm

7. Partitioning Strategies Types of partitioning* Composite partitioning: * http://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htmhttp://docs.oracle.com/cd/B28359_01/server.111/b32024/partition.htm

8. Divide and Conquer Strategies Characterized by dividing problem into sub-problems of same. Further divisions into still smaller sub-problems, usually done by recursion. Recursive divide and conquer amenable to parallelization because separate processes can be used for divided parts. Also usually data is naturally localized.

9. Examples Operations on sequences of number such as simply adding them together Several sorting algorithms can often be partitioned or constructed in a recursive fashion Numerical integration N-body problem

10. Applications Partitioning a sequence of numbers into parts and adding the parts

11. Applications Tree construction

12. Applications Dividing a list into parts

13. Applications Partial summarization

14. Applications Quadtree

15. Applications Numerical integration Computing the “area under the curve.” Parallelized by divided area into smaller areas (partitioning). Can also apply divide and conquer -- repeatedly divide the areas recursively.

16. Applications Numerical integration Numerical integration by rectangles:

17. Applications Numerical integration Numerical integration by trapezoidal method:

18. Applications Adaptive quadrature Based on the fixed number of intervals, we can obtain more accurate result through increasing the number of intervals between two rounds.

19. Summary Numerical integration Computing the “area under the curve.” Parallelized by divided area into smaller areas (partitioning). Can also apply divide and conquer -- repeatedly divide the areas recursively.