CS 584. Designing Parallel Algorithms. Designing a parallel algorithm is not easy. There is no recipe or magical ingredient Except creativity We can benefit from a methodical approach. Framework for algorithm design
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
1
4
ò
+
2
1
x
0
0
1
0
1
Split up the domain
0
1
Split up the domain
Now each
task simply
evaluates
the integral
in their range.
All that is
left is to
sum up each
task's answer
for the total.
0
0.25
0.5
0.75
1
Algorithm choice determines communication.
1
5
2
3
7
1
5
2
3
7
13
10
3
1
5
3
7
2
1
7
8
3
5
1
5
3
2
1
Results in structured nearest neighbor communication pattern.
Complicates the next stages of design
t = 1
t = 2
t = 3
How many messages total?
How much data is sent?
How many messages total?
How much data is sent?
s = sum
b = broadcast
How many steps?
Butterfly to Hypercube
æ
ö
ç
÷
p
=
i
r
R
ç
÷
å
i
p
ç
÷
è
ø
i