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.
Original language | English |
---|---|
Pages | 160-163 |
Number of pages | 4 |
Publication status | Published - 1996 Dec 1 |
Event | Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems - Montreal, Can Duration: 1996 Oct 21 → 1996 Oct 25 |
Other
Other | Proceedings of the 1996 2nd IEEE International Conference on Engineering of Complex Computer Systems |
---|---|
City | Montreal, Can |
Period | 96-10-21 → 96-10-25 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Computer Networks and Communications