A Round Robin Scheduling Policy for Ada
Although Ada defines a number of mechanisms for specifying scheduling policies, only one, Fifo_Within_Priorities is guaranteed to be supported by all implementations of the Real-Time Systems Annex. Many applications have a mixture of real-time and non real-time activities. The natural way of scheduling non real-time activities is by time sharing the processor using Round Robin Scheduling. Currently, the only way of achieving this is by incorporating yield operations in the code. This is ad hoc and intrusive. The paper proposes a new scheduling policy which allows one or more priority levels to be identified as round robin priorities. A task whose base priority is set to one of these levels is scheduled in a round robin manner with a user-definable quantum.
Unable to display preview. Download preview PDF.
- 1.A. Burns. Non-preemptive dispatching and locking policies. In M. Gonzále Harbour, editor, Proceedings of the 10th International Real-Time Ada Workshop, pages 46–47. ACM Ada Letters, 2001.Google Scholar
- 2.IEEE. Information Technology-Standardized Application Environment Profile-POSIX Realtime and Embedded Application Support (AEP) (POSIX): 1003.13:1998, 1998.Google Scholar
- 3.IEEE. Information Technology — Portable Operating System Interface (POSIX): 1003.1:2001, 2001.Google Scholar
- 4.IEEE. Information Technology — Standardized Application Environment Profile-POSIX Realtime Application Support (AEP) Draft 1003.13 (2), 2002.Google Scholar
- 5.M. Aldea Rivas and M. González Harbour. Extending Ada’s real-time systems annex with the POSIX scheduling services. In M. González Harbour, editor, Proceedings of the 10th International Real-Time Ada Workshop, pages 20–26. ACMAda Letters, 2001.Google Scholar
- 6.M. Aldea Rivas and M. González Harbour. MaRTE OS: An ada kernel for real-time embedded applications. In Reliable Software Technologies, Proceedings of the Ada Europe Conference, Leuven. Springer Verlag, LNCS 2043, 2001.Google Scholar