
266 Low Power Dynamic Scheduling for Computing Systems
Figure 9.10: The client/server system of Exercise 8, with decision variables
(γ[k],e[k]) and observed prices (φ[k],ψ[k]).
Exercise 8. (Energy Prices and Network Outsourcing) Consider a computer
server that operates over fixed length time slots k ∈{0, 1, 2,...}. Every slot
k, a new task arrives and has size S[k] (if no task arrives then S[k]=0).
The server decides to either accept the task, or outsource it to another server
(see Fig. 9.10). Let γ[k] be a binary decision variable that is 1 if the server
accepts the task on slot k, and zero else. Define A[k]=γ[k]S[k] as the total
workload admitted on ...