We have validated our framework by writing two schedulers. The first is a simple round robin scheduler, where the number of tasks is fixed. An array used as the scheduler data structure.
The other is a much complicated earliest deadline first scheduler, capable of detecting missed deadlines. In this scheduler, a priority queue (heap) is used to keep track of thread deadlines.