LOTTERY SCHEDULING WITHOUT TICKET REPLACEMENT. ADDING DETERMINISM TO LOTTERY SCHEDULING by

CPU scheduling schemes need to be reviewed to cater for the co-existence of real-time applications and non real-time ones. Lottery scheduling is a simple flexible algorithm that provides proportional fair-share scheduling and is thus suitable for meeting the new CPU scheduling challenges. However its guarantees are only probabilistic in nature. In this paper we present a modification to the lottery scheduling to convert it into a deterministic algorithm