Consider a set of “tasks” competing for the use of a single “resource”, where (i) only one task
is allowed to use the resource at a time,(ii) the resource is scheduled in unit-time
intervals,(iii) each task requires a specific fraction of the resource capacity over an extended
period, and (iv) tasks arrive and depart at any time. We refer to such a task system as an
instance of the single-resource scheduling problem. The problem of designing a “fair”
scheduling algorithm for such task systems has recently received a great deal of attention in …