schedulingforreducedcpuenergy(編輯修改稿)
2025-08-13 17:01 本頁面
【文章內(nèi)容簡介】 switch speeds ? No consideration of 30 second period of greater than 90% idleness ? Lower bound to practical speed: ? = 5 V ? = V ? = V ? = V Scheduling Algorithms ? OPT (unboundeddelay perfectfuture) ? Taking the entire trace ? Stretching all the run times to fill all the idle times ? Imaginary batch job with perfect knowledge ? Impractical amp。 undesirable ? Bad response time ? FUTURE (boundeddelay limitedfuture) ? Taking the future trace of a small window ? Window sizes: 1 ms ~ 400 sec ? Impractical but desirable ? Good response time on a window of 10 to 50 ms Scheduling Algorithms cont’d ? PAST (boundeddelay limitedpast) ? Looking a fixed window into the past ? Assuming the next window will be like the previous one ? Examine % busy during the pervious interval and adjust speed for the next interval ? Excess cycles can build up if speed (+voltage) is set too low. = Penalty metric ? Excess Cycle Penalty ? At each interval, count up left over cycles that accumulated because you ran too slow ? Switch to full speed if there were more excess cycles than idle time in the previous interval ? Hard idle (page fault, disk request) cannot be squeezed Trace Driven Simulation ? Trace Points ? Sched: context switch away a process ? Idle on: enter the idle loop ? Idle off: lea
化學(xué)相關(guān)推薦
鄂ICP備17016276號-1