Schedulability Analysis for Real-Time Systems with EDF Scheduling

• Published in: IEEE transactions on computers Vol. 58; no. 9; pp. 1250 - 1258
• Main Authors: Fengxiang Zhang, Burns, A.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2009; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Data mining; Deadlines; Job shop scheduling; Marketing; Mathematical analysis; Microprocessors; Multiprocessing/multiprogramming/multitasking; Optimal scheduling; Optimization; Processor scheduling; Real time; Real time systems; real-time and embedded systems; Scheduling; Studies; Tasks; Upper bound

Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest deadline first (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. Existing results on an exact schedulability test for EDF task systems with arbitrary relative deadlines need to calcula...