Scheduling of Periodic Tasks with Relative Timing Constraints
View/ Open
Date
1998-10-15Author
Cheng, Sheng-Tzong
Agrawala, Ashok K.
Metadata
Show full item recordAbstract
The problem of non-preemptive scheduling of a set of
periodic tasks on a single processor has been traditionally
considering the ready time and deadline on each task.
As a consequence, a feasible schedule finds that
in each period one instance of each task starts the
execution after the ready time and completes
the execution before the deadline .
Recently, the timing requirements of the real-time systems
emerge that the relative timing constraints are imposed on
the consecutive executions of each task.
In this paper, we consider the scheduling problem
of the periodic tasks with the relative timing constraints
imposed on two consecutive executions of a task.
We analyze the timing constraints and derive the scheduling
window for each task instance. Based on the scheduling
window, we present the time-based approach of scheduling a
task instance. The task instances are scheduled one by one
based on their priorities assigned by the proposed algorithms
in this paper. We conduct the experiments to compare
the schedulability of the algorithms.
(Also cross-referenced as UMIACS-TR-94-135)