Implementing a flexible scheduler in Ada

Abstract

Much of the research on flexible scheduling schemes is prevented from being used in practice by the lack of implementations that provide the necessary abstractions. In this paper we show how Ada's tasking facilities do enable such schedulers to be constructed. A case example is given that shows that the combination of existing language features is sufficient to program the required functionality. Only the lack of budget time management causes difficulty.