Title :
A Unified Hard/Soft Real-Time Schedulability Test for Global EDF Multiprocessor Scheduling
Author :
Leontyev, Hennadiy ; Anderson, James H.
Author_Institution :
Dept. of Comput. Sci., Univ. of North Carolina at Chapel Hill, Chapel Hill, NC
Abstract :
The issue of deadline tardiness is considered under earliest-deadline-first (GEDF) multiprocessor scheduling. New schedulability tests are presented for determining whether a set of sporadic tasks with arbitrary relative deadlines can be scheduled under either preemptive or non-preemptive GEDF so that pre-defined tardiness bounds are met. These tests are of pseudo-polynomial time complexity, and can be used in hard real-time, soft real-time, and mixed contexts.
Keywords :
computational complexity; processor scheduling; deadline tardiness; earliest-deadline-first; global EDF multiprocessor scheduling; pseudo-polynomial time complexity; real-time schedulability test; Chip scale packaging; Computer science; Job shop scheduling; Manufacturing; Multicore processing; Processor scheduling; Real time systems; Scheduling algorithm; System testing; Timing; deadline tardiness; global EDF; hard real-time; schedulability test; soft real-time;
Conference_Titel :
Real-Time Systems Symposium, 2008
Conference_Location :
Barcelona
Print_ISBN :
978-0-7695-3477-0
DOI :
10.1109/RTSS.2008.15
