Developing a scheduling framework for real-time operating systems

Abstract

Abstract

The complexity of embedded real-time systems has increased, and is expected to handle growing number of diverse applications. Most of these applications have large diversity in execution times of their tasks. Traditional scheduling techniques, such as Fixed-Priority Scheduling, Earliest Deadline First Scheduling (EDF), Rate Monotonic Scheduling (RMS), etc., do not satisfy the requirements of such applications. In most traditional scheduling techniques, one or group of tasks may dominate the CPU resources regardless of its criticality, which is called monopolism. In this context, the timing requirements of each application in the system should be isolated and guaranteed.