Earliest-Deadline-First scheduling on nonpreemptive real-time threads for a continuous media server

Abstract

The continuous-media application should use the real-time scheduling facility of the operating system to satisfy the time constraints. We consider the problem of non-preemptively scheduling periodic threads on a video server when the Earliest Deadline First(EDF) scheduling is used. When EDF scheduling is used for a set of periodic tasks, we can achieve high processor utilization. But the schedulability test is known to be an NP-hard problem.