The Cost-Benefit Framework
Given log(n) more resources than the optimal offline algorithm, this assignment policy achieves a maximum slowdown within log(n) of the optimal offline algorithm’s slowdown.
No guarantees with regards to average slowdown.
How does it work in practice ?