In particular, they present Ada 2012 code for implementing a subset of the current task splitting scheduling algorithms available. They also assess the many published algorithms and have selected those they think perform best (in terms of being able to schedule tasks at high utilization and generating few preemptions), and are illustrative of how different types of approaches can be programmed in Ada.

This content requires registration.

Log-in or register for a free account to get unlimited articles and full access to EDN.