Linux supports global and partitioned scheduling through its real-time scheduling class, which provides SCHED_FIFO and SCHED_RR fixed priority policies. Recently, the SCHED_DEADLINE policy was proposed that provides Earliest Deadline First scheduling with budget control. In this paper we propose a new implementation for global EDF scheduling which uses a heap global data structure to speed-up scheduling decisions. We also compare the execution time of the main scheduling functions in the kernel for four different implementations of global scheduling, showing that our implementation is as scalable and efficient as SCHED_FIFO.
An efficient and scalable implementation of global EDF in Linux
LIPARI, Giuseppe;CUCINOTTA, TOMMASO
2011-01-01
Abstract
Linux supports global and partitioned scheduling through its real-time scheduling class, which provides SCHED_FIFO and SCHED_RR fixed priority policies. Recently, the SCHED_DEADLINE policy was proposed that provides Earliest Deadline First scheduling with budget control. In this paper we propose a new implementation for global EDF scheduling which uses a heap global data structure to speed-up scheduling decisions. We also compare the execution time of the main scheduling functions in the kernel for four different implementations of global scheduling, showing that our implementation is as scalable and efficient as SCHED_FIFO.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
