Extending Ada's real-time systems annex with the POSIX scheduling services
IRTAW '00 Proceedings of the 10th international workshop on Real-time Ada workshop
Non-preemptive dispatching and locking policies
IRTAW '00 Proceedings of the 10th international workshop on Real-time Ada workshop
Report of session: flexible scheduling in Ada
IRTAW '03 Proceedings of the 12th international workshop on Real-time Ada
Task attribute-based scheduling: extending Ada's support for scheduling
IRTAW '03 Proceedings of the 12th international workshop on Real-time Ada
Application-defined scheduling in Ada
IRTAW '03 Proceedings of the 12th international workshop on Real-time Ada
AADL modeling and analysis of hierarchical schedulers
Proceedings of the 2007 ACM international conference on SIGAda annual international conference
A framework for flexible scheduling in the RTSJ
ACM Transactions on Embedded Computing Systems (TECS)
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
Estimation of backlog and delay in OFDM/TDMA systems with traffic policing using Network Calculus
Computers and Electrical Engineering
Hi-index | 0.00 |
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.