Scheduling distance-constrained real-time tasks

Abstract

A novel model of real-time task systems with temporal distance constraints is presented. In such systems, the distance between any two consecutive finishing times of the same task must be less than or equal to a given value. Using the periodic task model for such tasks may not provide an efficient solution. The authors discuss the scheduling approaches for this distance-constrained task model and propose several scheduling algorithms. They also study the schedulability conditions for these algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>