In this lecture, we examine the problem of “resource allocation and fairness”, choosing how to share finite resources among K users. Specifically, we go through (i) the welfare maximization problem, (ii) max-min fairness, proportional fairness and alpha fairness, and (iii) dominant resource fairness.
Lecture Notes: Lecture Notes part 2
Lecture Slides: Lecture Slides part 2
In this lecture, we examine the problem of “resource planning”, reserving resources for unknown demand, a very common problem encountered in cloud computing and data centers. Specifically, we go through (i) the newsvendor model, (ii) stochastic planning to a demand forecast, and (iii) elastic planning using the framework of Online Convex Optimization.
Lecture Notes: Lecture Notes part 1
Lecture Slides: Lecture Slides Part 1
In engineering systems often is the case that considering together two different domains of choice (like the scheduling and the routing of packets in the Internet) allows to extend the capabilities and unlock performance potential. Yet, in many systems this is thoroughly avoided, and the reason could be the principle of “time-scale separation”.
… Read the rest
Continue reading “Time-scale separation principle”