Preemption Handling and Scalability of Feedback DVSEDF优先处理和反馈DVSEDF可扩展性.pptVIP

9/22/2002 NC State University  Preemption Handling and Scalability of Feedback DVS-EDF Yifan Zhu , Frank Mueller mueller@cs.ncsu.edu Center for Embedded Systems Research / Department of Computer Science North Carolina State University Background Dynamic voltage scaling Reduce energy consumption by lowering the supply voltage and operating frequency Energy consumption scales lineally with frequency quadratically with voltage E ~ f ? V2 Hard real-time system Actual exec. time ? Worst case exec. time (WCET) Most practical system: utilization1 DVS-EDF Original EDF: DVS-EDF: , ?=scaling level Greedily scale current task Capitalize on early completion Slack Generation Two opportunities for slack generation: 1. Early completion of tasks 2. Idle slots Idle Slots -- Slack Introducing idle task into the task set, to convert idle time slots into slack We choose so that there is at least one idle time slot lying between any actual task’s invocation Slack Passing Slack generated by one task will usually not be exhausted when the task completes Initial slack capable to be passed on = C1-c1j Deadline Restriction Initial slack can’t be passed in full to the next task. Slack beyond the next task’s release time and deadline cannot be used. Assume: T1’s deadline is d1, T2 releases at r2 T2 can use: Adding Idle Slots Total slack can be further increased if idle task exists between T1 and T2’s deadline slack = slack + idle(d1…d2) Preemption Handling Preempted task relinquishes its remaining slack, passing it on to the next task Two differences here Preempted task itself cannot generate any slack Remaining exec. time of the preempted task must be reserved in advance Forward Sweep Scheme Remaining exec. time is reserved by stealing slack from the next task Assume: = 3 slots Forw