Download - What have we seen in class recently?
![Page 1: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/1.jpg)
What have we seen in class recently?
Daniel Shapiro
![Page 2: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/2.jpg)
• Exec time = (Task Crunch Amount)/(speed of PE)
• Makespan (longest critical path)• Adjacent communication delay(i,j) = (Data
amount)/(transfer rate between PEs)• in-forest: each node has at most one immediate successor• out-forest: each node has at most one immediate
predecessor
![Page 3: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/3.jpg)
Time
• Completion Time = Execution Time + Total Communication Delay
• Total Communication Delay = Number of communication messages * delay per message
• Execution time maximum finishing time of any task
![Page 4: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/4.jpg)
4
Scheduling inforest/outforest task graphs
1. The level of each node in the task graph is calculated as given above and used as each node’s priority
2. Whenever a processor becomes available, assign it the unexecuted ready task with the highest priority
![Page 5: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/5.jpg)
5
Example
10
14 13
12
11
9
8 7
5
6
4
2
3
1
P1 P2 P3
1
2 3 4
5 6 7
8 9 10 11 12
13 14 Level 5
Level 4
Level 3
Level 2
Level 11
1 1 1
1 1 1
1 1 1 1 1
1 1
![Page 6: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/6.jpg)
6
Scheduling interval ordered tasks
1. The number of successors of each node is used as each node’s priority
2. Whenever a processor becomes available, assign it the unexecuted ready task with the highest priority
![Page 7: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/7.jpg)
7
Example
0 0 0
3 2 1
4 5 61
9
1 1
1 1 1
1 1 1
1 2 3
654
7 8
Time P1 P2
123
4 5 6
87 9
P30
1
2
3
![Page 8: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/8.jpg)
8
a
b c
a
b
c
a
b
c
c
P1 P2 P1 P2
10
25
0
10
25
0
40
15
35c
40
50
x
x
x
Task Graph
Gantt Chart-2Gantt Chart-1
Task Exceution time
abc
101515
y
Arc Communication
(a,b) y
(a,c) x < y
x = 5 x = 25
30
Time Time
Communication Delay versus Parallelism
![Page 9: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/9.jpg)
9
Clustering
a
bc
g
d e
f
a
bc
g
d e
f
a
bc
g
d e
f
(a)(b)
(c)
a
bc
g
d e
f
(d)
![Page 10: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/10.jpg)
10
a
b c
a
b c
a
b
c
P1 P2 P1 P2
xx
Task Graph
x
a
No Duplication Task a is Duplicated
Duplications
![Page 11: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/11.jpg)
Real Stuff
• http://www.site.uottawa.ca/eng/school/publications/techrep/2010/
![Page 12: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/12.jpg)
Where is my T.A.?http://www.eng.tau.ac.il/~ieee/Convention/index.html
Instruction Set Extensions for Computation on Complex Floating Point Numbers
Parallel instruction set extension identification
![Page 13: What have we seen in class recently?](https://reader030.vdocuments.net/reader030/viewer/2022032414/5681338d550346895d9a9618/html5/thumbnails/13.jpg)
Questions?
• Danke