On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 160-171
- https://doi.org/10.1109/real.1993.393504
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Evaluation of the probability of dynamic failure and processor utilization for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Engineering and analysis of fixed priority schedulersIEEE Transactions on Software Engineering, 1993
- Dynamic scheduling of hard real-time tasks and real-time threadsIEEE Transactions on Software Engineering, 1992
- Priority inheritance protocols: an approach to real-time synchronizationIEEE Transactions on Computers, 1990
- Fixed priority scheduling of periodic task sets with arbitrary deadlinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973