Implications of classical scheduling results for real-time systems
- 1 June 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 28 (6), 16-25
- https://doi.org/10.1109/2.386982
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Earliest deadline scheduling for real-time database systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Recent Results in the Theory of Machine SchedulingPublished by Springer Nature ,1983
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- 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
- Polynomial complete scheduling problemsPublished by Association for Computing Machinery (ACM) ,1973
- Optimal scheduling for two-processor systemsActa Informatica, 1972
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959