Stack-based scheduling for realtime processes
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Michael González Harbour: MaRTE OS: An Ada Kernel for Real-Time Embedded Applications
Ada Europe '01 Proceedings of the 6th Ade-Europe International Conference Leuven on Reliable Software Technologies
WCET Analysis of Probabilistic Hard Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Response Time Analysis for Tasks Scheduled under EDF within Fixed Priorities
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Probabilistic timing analysis: An approach using copulas
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Correcting the EDF protocol in Ada 2005
IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Integrating application-defined scheduling with the new dispatching policies for ada tasks
Ada-Europe'05 Proceedings of the 10th Ada-Europe international conference on Reliable Software Technologies
Going real-time with Ada 2012 and GNAT
ACM SIGAda Ada Letters
Incorporating the deadline floor protocol in ada
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
The Ada 2005 task dispatching model includes new scheduling policies such as EDF and round robin, in addition to the traditional fixed priority dispatching, and allows mixing these policies into a hierarchy of schedulers. This hierarchical scheduling model is a very interesting solution that allows us to have in the same system the best properties of the three policies: the high performance of EDF, the predictability of fixed priorities, and the fair distribution of unused capacity provided by a round robin scheduler. The paper presents one of the first implementations of this hierarchical dispatching model, built with GNAT over MaRTE OS. An evaluation of the implementation is provided and examples of usage are shown.