Beruflich Dokumente
Kultur Dokumente
Rahim Soleymanpour
Siamak Mohammadi
Hamed Rajabi
Shomal University
Amol ,Iran
h.rajabi@shomal.ac.ir
Introduction
Related Work
- 151 -
ISOCC 2012
III.
Proposed Algorithm
1 :
2 :
3 :
4 :
5 :
6 :
7 :
8 :
9 :
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
consumption_area0;
best_merit ;
improvement true;
profiling for all tasks;
while (consumption_area <area_budget && improvment == true) do
initialize AEST and ALST for all tasks;
unscheduling for all task;
temp_merit ;
while(!(all node scheduled)) do
task=identifyTask();
if task is on critical path then
paramCI =select_processor(task,critical,best_merit);
else
select_processor(task,non critical);
end if
update AEST and ALST for all nodes;
if paramCI.merit > temp_merit then
//compute best merit CI for next iteration
swap(paramCI.merit , temp_merit);
end if
compute area consumption;
end while
update of best_merit for next iteation
compute traffic and energy consumption in NoC;
compute improvement;//based on history
save intermediate result;
end while;
select best solution;
- 152 -
ISOCC 2012
Algorithm 2 (continuance):
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
processors, if possible.
(2)
Normalized execution
time
YZ [ \]^_`abcdef
gh [
Network
best_Composite_AEST childAEST+ThisAEST;
end if
if childAEST+ThisAEST<best_Composite_AEST_unreal &&
state==temp then
best_ temp_processor nameProc;
best_temp_Composite_AESTchildAEST+ThisAEST;
best_diffdiff;
undo exeTime(task) += diff;
end if;
end if
end do
If task is critical then
Coff_comm compute coefficient of communication;
parmCIs select_CIs(task,best_merit , coff_comm);
if best_processor_temp!=best_processor then
map task into best_temp_processor;
end if
end if
assign task to the best processor;
Return paramCIs;
Experimental Results
App1
MPEG2DEC
App2
Algorithm [12]
Normalized network
traffic
Figure 1. Effect of adding custom instruction on execution time with different benchmarks
Network
MPEG2DE
App1
App2
Algorithm [12]
Our proposed algorithm
Figure 2. Effect of adding custom instruction on network traffic with different benchmarks
- 153 -
ISOCC 2012
Our
Algorithm
Algorithm
[12]
Our
Algorithm
7.1151
10.5814
2.1735
23.97%
21.76%
4
24.75%
15.03%
5
69.26%
28.13%
3
Algorithm
[12]
Algorithm
[12]
1.3931
0.6981
0.2709
0.5106
0.6736
69.25%
-10.94%
3
33.78%
0.0%
2
5.88%
0.0%
2
48.44%
56%
2
34.29%
0.0%
2
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
Conclusion
Our
Algorithm
Algorithm
[12]
Reference
V.
Networking
Our
Algorithm
[15]
[16]
[17]
[18]
- 154 -
ISOCC 2012