Jump to content

Earliest eligible virtual deadline first scheduling

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Widefox (talk | contribs) at 13:09, 2 September 2023 (Filled in 1 bare reference(s) with reFill 2). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

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.[1]

In 2023, Peter Zijlstra proposed replacing the Completely Fair Scheduler (CFS) in the Linux kernel with an EEVDF process scheduler.[3] The aim was to remove the need for CFS "latency nice" patches.[4]

See also

References

  1. ^ a b 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.
  2. ^ https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=805acf7726282721504c8f00575d91ebfd750564
  3. ^ "EEVDF Scheduler May Be Ready For Landing With Linux 6.6". Phoronix. Retrieved 2023-08-31.
  4. ^ "An EEVDF CPU scheduler for Linux [LWN.net]". LWN.net. Retrieved 2023-08-31.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Earliest_eligible_virtual_deadline_first_scheduling&oldid=1173443525"