Schedulable Utilization Bounds for EPDF Fair Multiprocessor Scheduling ∗

@inproceedings{Devi2004SchedulableUB,
  title={Schedulable Utilization Bounds for EPDF Fair Multiprocessor Scheduling ∗},
  author={UmaMaheswari Devi and James H. Anderson},
  year={2004}
}
The earliest-pseudo-deadline-first (EPDF) algorithm is less expensive than other known Pfair algorithms, but is not optimal for scheduling recurrent real-time tasks on more than two processors. Prior work established sufficient per-task weight ( i.e., utilization) restrictions that ensure that tasks either do not miss their deadlines or have bounded… CONTINUE READING