Multiprocessor online scheduling of hard-real-time tasks
- 1 December 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 15 (12) , 1497-1506
- https://doi.org/10.1109/32.58762
Abstract
The problems of hard-real-time task scheduling in a multiprocessor environment are discussed in terms of a scheduling game representation of the problem. It is shown that optimal scheduling without a priori knowledge is impossible in the multiprocessor case even if there is no restriction on preemption owing to precedence or mutual exclusion constraints. Sufficient conditions that permit a set of tasks to be optimally scheduled at run time are derived.<>Keywords
This publication has 6 references indexed in Scilit:
- Distributed broadcast channel accessComputer Networks (1976), 1979
- Antwortzeitgesteuerte Prozessorzuteilung unter strengen ZeitbedingungenComputing, 1978
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Scheduling with earliest start and due date constraintsNaval Research Logistics Quarterly, 1971