Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars in Google
Share
DYNA
Print version ISSN 0012-7353
Abstract
MEJIA, María; MORALES-BETANCOURT, Adriana and PATKI, Tapasya. Lottery scheduler for the Linux kernel. Dyna rev.fac.nac.minas [online]. 2015, vol.82, n.189, pp.216-225. ISSN 0012-7353. https://doi.org/10.15446/dyna.v82n189.43068.
This paper describes the design and implementation of Lottery Scheduling, a proportional-share resource management algorithm, on the Linux kernel. A new lottery scheduling class was added to the kernel and was placed between the real-time and the fair scheduling class in the hierarchy of scheduler modules. This work evaluates the scheduler proposed on compute-intensive, I/O-intensive and mixed workloads. The results indicate that the process scheduler is probabilistically fair and prevents starvation. Another conclusion is that the overhead of the implementation is roughly linear in the number of runnable processes.
Keywords : Lottery scheduling; Schedulers; Linux kernel; operating system.