Schedule Validation for Embedded Reactive Real-Time Systems

Task scheduling forreactive real time systems is a di cult problem due to tight constraints that the schedule must satisfy. A static priority scheme is proposed here that can be formally validated. The method is applicable both for preemptive and non-preemptive schedules and is conservative in the sense that a valid schedule may be declared invalid, but no invalid schedule may be declared valid. Experimental results show that the run time of our validation method is negligible with respect to other steps in system design process, and compares favorably with other methods of schedule validation.

• Type: Conference
• Year: 1997
• Where: DAC
• Authors: Felice Balarin, Alberto L. Sangiovanni-Vincentelli
• Keywords: Computer Architecture, DAC 1997, Di Cult Problem, Forreactive Real Time, Static Priority Scheme