Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems
References (11)
An optimal scheduling algorithm for pre-emptable real-time tasks
Inform. Process. Lett.
(1994)- et al.
Mechanisms for enhancing the flexibility and utility of hard real-time systems
- et al.
Scheduling slack time in fixed priority pre-emptive systems
Scheduling a production line to minimise maximum tardiness
- et al.
An optimal algorithm for scheduling soft-aperiodic tasks fixed-priority preemptive systems
There are more references available in the full text version of this article.
Cited by (12)
A review of priority assignment in real-time systems
2016, Journal of Systems ArchitectureA lazy algorithm for distributed priority assignment in real-time systems
2011, Proceedings - 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops, ISORCW 2011Energy-efficient static priority and speed assignment for real-time tasks with non-deterministic release times
2010, Proceedings - 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2010Optimal period and priority assignment for a networked control system scheduled by a fixed priority scheduling system
2007, International Journal of Automotive TechnologyRobust priority assignment for fixed priority real-time systems
2007, Proceedings - Real-Time Systems SymposiumOptimal time-variant resource allocation for internet servers with delay constraints
2005, Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
Copyright © 1995 Published by Elsevier B.V.