Analysis of Deadline-Driven Scheduling Algorithms Using Function-Driven TechniquesReport
Real-time systems must be responsive to task deadlines, hence deadlinedriven scheduling algorithms pervade real-time scheduling. Scheduling algorithms, whether for real-time system or not, often focus one or only a few of the task attributes or system characteristics for discriminating among competing tasks. The task set is comprised of tasks that either are dependent on the particular attributes or are forced to be. Expression of scheduling algorithms using function-driven techniques, in particular the importance abstraction [STRA92] employs functions to profile task importance; the scheduler greedily chooses the most important task at every point in time. We explore the use of this abstraction for the class of task sets that have at least some deadline-driven tasks but are not limited to tasks with only deadlines as attributes or which are dependent only on deadlines for their importance.
Note: Abstract extracted from PDF text
All rights reserved (no additional license for public reuse)
Strayer, W. "Analysis of Deadline-Driven Scheduling Algorithms Using Function-Driven Techniques." University of Virginia Dept. of Computer Science Tech Report (1992).
University of Virginia, Department of Computer Science