Limited Preemptive Scheduling for Real-Time Systems. A Survey

A non-preemptive scheduling algorithm for soft real-time systems

1 Please direct all correspondence to Krishna Kavi, Department of Computer Science and Engineering, The University of North Texas, P.O. Box 311366, Denton, Texas 76203, [email protected] Abstract Real-time systems are often designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring no...

Non-preemptive real-time scheduling of dataflow systems

Real-time signal processing applications can be described naturally with dataflow graphs. The systems we consider have a mix of real-time and non-real-time processing, where independent dataflow graphs represent tasks and individual dataflow actors are subtasks. Rate-monotonic scheduling is optimal for fixed-priority, preemptive scheduling of periodic tasks. Priority inheritance protocols exten...

An Efficient Non-Preemptive Real-Time Scheduling

Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strateg...

Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling

A Class of Non-preemptive Scheduling Algorithms for Real-time Systems

We introduce a class of scheduling algorithms, based upon the estimated extinction time, defined as the latest time a a task must begin its service in order to meet its deadlines in a real time system. At time t the algorithms use a scheduling window which covers the interval [ ( t + g(0), (r + g(t) + ) ], and all tasks with estimated extinction time withiti this window are eligible for selecti...