1 / 13

Progress Report

Progress Report. 2013/08/08. Example. Deadline of interactive task 2. Deadline of interactive task 1. Deadline of interactive task 3. Interactive Task 1. Interactive Task 2. Interactive Task 3. Computation Task 3. i =1. i =2. Core0. H. Interactive Task 3. Computation Task 4. Core1.

mae
Download Presentation

Progress Report

An Image/Link below is provided (as is) to download presentation 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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Progress Report 2013/08/08

  2. Example Deadline of interactive task 2 Deadline of interactive task 1 Deadline of interactive task 3 Interactive Task 1 Interactive Task 2 Interactive Task 3 Computation Task 3 i=1 i=2 Core0 H Interactive Task 3 Computation Task 4 Core1 H Computation Task 1 Computation & Background Tasks Back ground Task 2 Core2 L Computation Task 2 Background Task 1 Core3 L

  3. Workload – Candy Crush

  4. Workload – Monkey

  5. Simulation Input

  6. Simulation Results - Drop

  7. Simulation Results - Compensate

  8. Simulation Results - Comparison

  9. Model Modification • Each core works under the same frequency due to hardware limitation. • A task can have different processing rates during its execution.

  10. Observation 1 • If there is only one task, the processing rate should remain unchanged. • => w = 0 or 1 w 1-w

  11. Observation 2 • Frequency changing only happens when a new task arrived or a task has finished. B1 B1 B1 B2-B1 B2-B1 B1

  12. 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 Task1 Task0 Task1 t0 t1 t2’ t2

  13. Discussion

More Related