Progress Report 2013/08/08
Computation & Background Tasks Example Deadline of interactive task 1 Deadline of interactive task 2 Deadline of interactive task 3 Interactive Task 1 Computation & Background Tasks Interactive Task 2 Computation Task 3 Interactive Task 3 i=1 i=2 Core0 H Interactive Task 3 Computation Task 4 Core1 H Computation Task 1 Back ground Task 2 Core2 L Computation Task 2 Background Task 1 Core3 L
Workload – Candy Crush
Workload – Monkey
Simulation Input
Simulation Results - Drop Energy After Normalization Drop Ratio Baseline 2194560e 1.0 Adaptive 1374015e 0.626 1.01% IEDF+BF 739080e 0.337 6.81%
Simulation Results - Compensate Energy After Normalization Baseline 2194560e 1.0 Adaptive 1381700e 0.630 IEDF+BF 1042584e 0.475
Simulation Results - Comparison Energy After Normalization Case 1 Baseline 2194560e 1.0 Adaptive 1381700e 0.630 IEDF+BF 1042584e 0.475 Case 2 (Busy) 2100384e 2086221e 0.993 2147957e 1.023
Model Modification Each core works under the same frequency due to hardware limitation. A task can have different processing rates during its execution.
Observation 1 If there is only one task, the processing rate should remain unchanged. => w = 0 or 1 w 1-w
Observation 2 Frequency changing only happens when a new task arrived or a task has finished. B2-B1 B1 B1 B1 B2-B1 B1
Length of Overlapping Assume that tasks have different arrival time. Increase the processing rate of Task0 during t0 to t1 reduces the overlapping of Task0 and Task1. Task0 t1 t0 Task1 t2’ t2
Discussion