Earliest eligible virtual deadline first scheduling

Earliest eligible virtual deadline first (EEVDF) is a dynamic priority proportional share scheduling algorithm for soft real-time systems. == 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.

Source: Wikipedia — Earliest eligible virtual deadline first scheduling (CC BY-SA 4.0)

Earliest eligible virtual deadline first scheduling

Earliest eligible virtual deadline first (EEVDF) is a dynamic priority proportional share scheduling algorithm for soft real-time systems. == 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.

Source: Wikipedia "Earliest eligible virtual deadline first scheduling" · CC BY-SA 4.0

Share this article: X · Bluesky
Privacy Policy