Static schedulers for embedded real-time systems.

Abstract

Because of the need for having efficient scheduling algorithms in large scale real-time systems, software engineers put a lot of effort on developing scheduling algorithms with high performance. But neither algorithm developed upto now is perfect for all cases. At this stage, instead of having one scheduling algorithm in the system, more than one different algorithms which will try to find a feasible solution to the scheduling problem according to the initial properties of the tasks would be very useful to reach a high performance scheduling for the system. This report represents the effort to provide static schedulers for the Embedded Real- Time Systems with single processor using the Ada programming language. The independent nonpreemptable algorithms used in these static schedulers are run according to the timing constraints and precedence relationships of the critical operators extracted from a high level source program. The final schedule guarantees that timing constraints for the critical jobs are met. The primary goal of this report is to support the Computer Aided Rapid Prototyping for Embedded Real-Time Systems so that we will determine whether the system, as designed, will meet the required timing specifications. Secondary goal is to demonstrate the significance of Ada as the implementation language.