ABSTRACT
Most recent research on hard real-time systems has used the periodic task model [1] in analyzing the schedulability of a given task set in which tasks are released periodically. Based on this periodic task model, various schedulability analysis methods for priority-driven systems have been developed to provide a deterministic guarantee that all the instances, called jobs, of every task in the system meet their deadlines, assuming that every job in a task requires its worst-case execution time [1-3].
