Scheduling Tasks with Precedence Constraints and Shared Resource for Multimedia Streams
Zhang Zhan · 1999
Some issues of scheduling tasks with precedence constraints and shared resource are discussed in this paper. The authors present the scheduling algorithm QNES (quasi normality -EDF -scheduler) by means of defining the notion of quasi normality and making consistency of precedence constraints among tasks and partial order on tasks. QNES can access shared resource based on PCP (priority ceiling protocol) or SRP (stack resource policy) protocols, and has characters of preemption, dealing with precedence constraints among tasks and accessing shared resource, and is suitable to uni processor systems.