An optimal on-line scheduler is given for a set of real-time tasks with one common deadline on m processors. It is shown that no optimal on-line scheduler can exist for tasks with two distinct deadlines. Finally, an optimal on-line scheduler is given for situations where processors can go down unexpectedly.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics