bv_cvxbook_extra_exercises

# E we do not pump power back into the grid the total

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: there is no limit E max on E as in part (a); you are to ﬁnd the optimal trade-oﬀ of E versus T . 16.5 Minimum energy processor speed scheduling. A single processor can adjust its speed in each of T time periods, labeled 1, . . . , T . Its speed in period t will be denoted st , t = 1, . . . , T . The speeds must lie between given (positive) minimum and maximum values, S min and S max , respectively, and must satisfy a slew-rate limit, |st+1 − st | ≤ R, t = 1, . . . , T − 1. (That is, R is the maximum allowed period-to-period change in speed.) The energy consumed by the processor in period t is given by φ(st ), where φ : R → R is increasing and convex. The total energy consumed over all the periods is E = T=1 φ(st ). t The processor must handle n jobs, labeled 1, . . . , n. Each job has an availability time Ai ∈ {1, . . . , T }, and a deadline Di ∈ {1, . . . , T }, with Di ≥ Ai . The processor cannot start work on job i until period t = Ai , and must complete the job by the end of period Di . Job i involves a (nonnegative) total work Wi . You can assume that in each time...
View Full Document

## This note was uploaded on 09/10/2013 for the course C 231 taught by Professor F.borrelli during the Fall '13 term at University of California, Berkeley.

Ask a homework question - tutors are online