bv_cvxbook_extra_exercises

n pmax 10 i i 1 for i 1 m and network

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: formulation of the problem is convex, and why it is equivalent to the problem statement above. Important: • Your formulation must be convex for any function f that is positive, increasing, and convex. You cannot make any further assumptions about f . • This problem refers to the general case, not the small example described above. (b) Consider the specific instance with data given in proc_speed_data.m, and processor power f (s) = 1 + s + s2 + s3 . The precedence constraints are given by an m × 2 matrix prec, where m is the number of precedence constraints, with each row giving one precedence constraint (the first column gives the precedents). Plot the optimal trade-off curve of energy E versus time T , over a range of T that extends from its minimum to its maximum possible value. (These occur when all processors operate at smax and smin , respectively, since T is monotone nonincreasing in s.) On the same plot, show the energy-time trade-off obtained when all processors operate at the same speed s, which is ¯ varied from smin to smax . Note: In this part of the problem...
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 Berkeley.

Ask a homework question - tutors are online