Abstract
Earliest Deadline First (EDF) dispatching has been introduced into the Ada 2005 definition. Included in this definition is support for Baker's protocol for preemption level control over access to protected objects. Unfortunately the current model fails to implement all the situations covered by Baker's approach. A counter example is provided that illustrates this deficiency with the language as currently defined. A minor change to the language definition is proposed that removes the flaw.
- T. P. Baker. Stack-based scheduling of realtime processes. Real-Time Systems, 3(1), March 1991. Google Scholar
Digital Library
Index Terms
Correcting the EDF protocol in Ada 2005
Recommendations
Correcting the EDF protocol in Ada 2005
IRTAW '07: Proceedings of the 13th international workshop on Real-time AdaEarliest Deadline First (EDF) dispatching has been introduced into the Ada 2005 definition. Included in this definition is support for Baker's protocol for preemption level control over access to protected objects. Unfortunately the current model fails ...
Generalizing the EDF scheduling support in Ada 2005
Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms,...
U-EDF: An Unfair But Optimal Multiprocessor Scheduling Algorithm for Sporadic Tasks
ECRTS '12: Proceedings of the 2012 24th Euromicro Conference on Real-Time SystemsA multiprocessor scheduling algorithm named U-EDF, was presented in [1] for the scheduling of periodic tasks with implicit deadlines. It was claimed that U-EDF is optimal for periodic tasks (i.e., it can meet all deadlines of every schedulable task set) ...







Comments