Mixing scheduling policies in ada

Abstract

Extending the real-time capabilities of the Ada language is a major topic of the current review process of the Ada language. One of the alternatives which is being considered forAda is to introduce the possibility of using a mixture of scheduling policies. Two approaches have been presented in previous works to meet this objective: per-task policies and per-priority policies. In this paper, we evaluate both of these approaches using them to define an interesting real-time scheduling policy known as the Dual Priority Scheduling policy. As a result of this evaluation, we also propose a hybrid approach.