In this post, we will have overview of Decomposition Techniques in Parallel Computing.
Decomposition means dividing the big task into the sub-tasks. We allocate these sub tasks to the different processors.
Watch following video:
Watch on YouTube: https://www.youtube.com/watch?v=PUfQ4eHigog
Broadly, there are four Decomposition Techniques in Parallel Computing.
1. Recursive Decomposition
2. Data Decomposition
3. Exploratory Decomposition
4. Speculative Decomposition
1. Recursive Decomposition
It is based on recursion.
e.g. Quick Sort
2. Data Decomposition
c1=a1*b1+a2*b3
c2=a1*b2+a2*b4
c3=a3*b1+a4*b3
c4=a3*b2+a4*b4
3. Exploratory Decomposition
4. Speculative Decomposition
e.g. Switch case
Decomposition means dividing the big task into the sub-tasks. We allocate these sub tasks to the different processors.
Watch following video:
Watch on YouTube: https://www.youtube.com/watch?v=PUfQ4eHigog
Broadly, there are four Decomposition Techniques in Parallel Computing.
1. Recursive Decomposition
2. Data Decomposition
3. Exploratory Decomposition
4. Speculative Decomposition
1. Recursive Decomposition
It is based on recursion.
e.g. Quick Sort
Task Dependency Graph
2. Data Decomposition
c1=a1*b1+a2*b3
c2=a1*b2+a2*b4
c3=a3*b1+a4*b3
c4=a3*b2+a4*b4
3. Exploratory Decomposition
4. Speculative Decomposition
e.g. Switch case
No comments:
Post a Comment