Stack-based scheduling for realtime processes
Real-Time Systems
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
ISO-IEC 9945-2: IEEE Std. 1003.2-1992 Information Technology - Portable Operating System Interface: Shell and Utilities
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
Integrating Multimedia Applications in Hard Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Implementing a General Real-Time Scheduling Framework in the RED-Linux Real-Time Kernel
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Application-defined scheduling in Ada
IRTAW '03 Proceedings of the 12th international workshop on Real-time Ada
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Vassal: loadable scheduler support for multi-policy scheduling
WINSYM'98 Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
A round robin scheduling policy for Ada
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
POSIX trace based behavioural reflection
Ada-Europe'06 Proceedings of the 11th Ada-Europe international conference on Reliable Software Technologies
Hi-index | 0.00 |
In previous papers we had presented an application program interface (API) that enabled applications to use application-defined scheduling algorithms for Ada tasks in a way compatible with the scheduling model defined in the real-Time Annex of the language. Each application scheduler was implemented with a special task. This paper presents a new implementation in which the application scheduler actions are executed as part of the kernel on which the run-time system is based, thus increasing the efficiency. This paper also presents modifications to the proposed API that align it with the evolution of the Ada Issues being considered in the Ada 200Y standardization. First, we use the new concept of deadline as an abstract notion of urgency, to order the tasks in the scheduling queue of the underlying kernel, freeing the application scheduler of the responsibility of keeping the desired ordering of tasks, and thus simplifying it and reducing its overhead. In second place, we also consider task synchronization through protected objects using the new Stack Resource Policy proposed for the EDF task dispatching policy in Ada 200Y, which can be used in a large variety of fixed and dynamic priority scheduling policies without explicit intervention of the application scheduler.