schedulingforreducedcpuenergy-文庫吧資料
2024-07-30 17:01本頁面
【正文】 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: leave idle loop to run a process ? Fork: create a new process ? Exec: overlay a new process with another program ? Exit: process termination ? Sleep: wait on an event ? Wakeup: notify a sleeping process ? Traces ? Short runs during speci?c tasks, editing etc. ? Long runs of several hours Evaluation: The Results of Three Algorithms Q u i c k T i m e ? a n d a d e c o m p re s s o ra re n e e d e d t o s e e t h i s p i c t u re . Evaluation: Minimal Voltage amp。 less energy per cycle ? Reducing The Energy Consumption ? The same of cycles but lower voltage ? Ex: a task with 100ms
化學(xué)相關(guān)推薦
鄂ICP備17016276號(hào)-1