并行算法概述课件.ppt

Recursive Decomposition: Example The code in the previous foil can be decomposed naturally using a recursive decomposition strategy. We illustrate this with the following example of finding the minimum number in the set {4, 9, 1, 7, 8, 11, 2, 12}. The task dependency graph associated with this computation is as follows: 精品文档 Data Decomposition Identify the data on which computations are performed Partition this data across various tasks This partitioning induces a decomposition of the problem Data can be partitioned in various ways - this critically impacts performance of a parallel algorithm 精品文档 Data Decomposition: Output Data Decomposition Often, each element of the output can be computed independently of others (but simply as a function of the input). A partition of the output across tasks decomposes the problem naturally. 精品文档 Output Data Decomposition: Example Consider the problem of multiplying two n x n matrices A and B to yield matrix C. The output matrix C can be partitioned into four tasks as follows: Task 1: Task 2: Task 3: Task 4: 精品文档 Output Data Decomposition: Example A partitioning of output data does not result in a unique decomposition into tasks. For example, for the same problem as in previous foil, with identical output data distribution, we can derive the following two (other) decompositions: Decomposition I Decomposition II Task 1: C1,1 = A1,1 B1,1 Task 2: C1,1 = C1,1 + A1,2 B2,1 Task 3: C1,2 = A1,1 B1,2 Task 4: C1,2 = C1,2 + A1,2 B2,2 Task 5: C2,1 = A2,1 B1,1 Task 6: C2,1 = C2,1 + A2,2 B2,1 Task 7: C2,2 = A2,1 B1,2 Task 8: C2,2 = C2,2 + A2,2 B2,2 Task 1: C1,1 = A1,1 B1,1 Task 2: C1,1 = C1,1 + A1,2 B2,1 Task 3: C1,2 = A1,2 B2,2 Task 4: C1,2 = C1,2 + A1,1 B1,2 Task 5: C2,1 = A2,2 B2,1 Task 6: C2,1 = C2,1 + A2,1 B1,1 Task 7: C2,2 = A2,1 B1,2 Task 8: C2,2 = C2,2 + A2,2 B2,2 精品文档 Output Data Decomposition: Example Consider the problem of counting the instances of given item-sets in a database o