| Abstract |
|
We consider the scheduling problem for periodic tasks with relative timing requirements. Specifically, the timing constraints imposed on the consecutive executions of a task and the inter-task temporal constraints across task periods are considered. A pre-run-time timing analysis technique is applied to the set of tasks. A schedule is generated in which the length of the schedule is the least common multiple (LCM) of all periods. Experiments are conducted to evaluate the performance of the algorithm.
|
 Additional Information
|
Index Terms- Scheduling, relative timing constraints, real-time, allocation, jitters
Citation:
Sheng-Tzong Cheng, Chia-Mei Chen,
"A Cyclic Scheduling for Relative Timing Requirements,"
iceccs,
p. 160,
Second IEEE International Conference on Engineering of Complex Computer Systems (ICECCS'96),
1996
|
