Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Earliest eligible virtual deadline first scheduling
Dynamic scheduling algorithm

Earliest eligible virtual deadline first (EEVDF) is a dynamic priority proportional share scheduling algorithm for soft real-time systems.

We don't have any images related to Earliest eligible virtual deadline first scheduling yet.
We don't have any YouTube videos related to Earliest eligible virtual deadline first scheduling yet.
We don't have any PDF documents related to Earliest eligible virtual deadline first scheduling yet.
We don't have any Books related to Earliest eligible virtual deadline first scheduling yet.
We don't have any archived web articles related to Earliest eligible virtual deadline first scheduling yet.

Algorithm

EEVDF was first described in the 1995 paper "Earliest Eligible Virtual Deadline First : A Flexible and Accurate Mechanism for Proportional Share Resource Allocation" by Ion Stoica and Hussein Abdel-Wahab.2 It uses notions of virtual time, eligible time, virtual requests and virtual deadlines for determining scheduling priority.3 It has the property that when a job keeps requesting service, the amount of service obtained is always within the maximum quantum size of what it is entitled.4

Linux kernel scheduler

See also: Linux kernel § Scheduling

In 2023, Peter Zijlstra proposed replacing the Completely Fair Scheduler (CFS) in the Linux kernel with an EEVDF process scheduler.56 The aim was to remove the need for CFS "latency nice" patches.7 The EEVDF scheduler replaced CFS in version 6.6 of the Linux kernel.8

See also

References

  1. Erickson, Jeremy P.; Anderson, James H. (September 2, 2022). Tian, Yu-Chu; Levy, David Charles (eds.). Handbook of Real-Time Computing. Springer Nature. pp. 233–267. doi:10.1007/978-981-287-251-7_4 – via Springer Link. /wiki/James_H._Anderson_(computer_scientist) ↩

  2. Stoica, Ion; M. Abdel-Wahab, Hussein (1995). Earliest Eligible Virtual Deadline First : A Flexible and Accurate Mechanism for Proportional Share Resource Allocation (Technical report). CS Dpt., Old Dominion Univ. TR-95-22. https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=805acf7726282721504c8f00575d91ebfd750564 ↩

  3. Erickson, Jeremy P.; Anderson, James H. (September 2, 2022). Tian, Yu-Chu; Levy, David Charles (eds.). Handbook of Real-Time Computing. Springer Nature. pp. 233–267. doi:10.1007/978-981-287-251-7_4 – via Springer Link. /wiki/James_H._Anderson_(computer_scientist) ↩

  4. Epema, D. H. J. (November 2, 1998). "Decay-usage scheduling in multiprocessors". ACM Transactions on Computer Systems. 16 (4): 367–415. doi:10.1145/292523.292535. https://doi.org/10.1145%2F292523.292535 ↩

  5. "EEVDF Scheduler May Be Ready For Landing With Linux 6.6". Phoronix. Retrieved 2023-08-31. https://www.phoronix.com/news/Linux-6.6-EEVDF-Likely ↩

  6. "[PATCH 00/10] sched: EEVDF using latency-nice [LWN.net]". LWN.net. https://lwn.net/ml/linux-kernel/[email protected]/ ↩

  7. "An EEVDF CPU scheduler for Linux [LWN.net]". LWN.net. Retrieved 2023-08-31. https://lwn.net/Articles/925371/ ↩

  8. "EEVDF Scheduler Merged For Linux 6.6, Intel Hybrid Cluster Scheduling Re-Introduced". Phoronix. https://www.phoronix.com/news/Linux-6.6-EEVDF-Merged ↩