We presented two different approaches to soft real-time scheduling: the well
known Proportional Share Resource Allocation and the Constant Bandwidth
Resource Allocation. We compared by simulations some Proportional Share
schedulers with our Constant Bandwidth scheduler, showing how at a cost of
a smaller fairness, CBS generates a minor number of context switches,
resulting in a more efficient scheduling. Moreover, CBS does not generate
any CPU waste when hard real-time tasks are present in the system, so
it is more appropriate to support multimedia tasks in time-dependent
applications.
