Min-Energy Voltage Allocation for Tree-Structured Tasks

Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together with required number of CPU cycles. It is known that the minimum energy schedule for n jobs can be computed in O(n3 ) time, assuming a convex energy function. We investigate more efficient algorithms for computing the optimal schedule when the job sets have certain special structures. When the time intervals are structured as trees, the minimum energy schedule is shown to have a succinct characterization and is computable in time O(P) where P is the tree’s total path length. We also study an on-line average-rate heuristics AVR and prove that its energy consumption achieves a small constant competitive ratio for nested job sets and for job sets with limited overlap. Some simulation results are also given. Keywords Scheduling · Variable voltage processor · Energy efficiency

• Type: Conference
• Year: 2005
• Where: COCOON
• Authors: Minming Li, Becky Jie Liu, Frances F. Yao
• Keywords: COCOON 2005, Convex Energy Function, Job Sets, Minimum Energy Schedule