Scheduling with Message Deadlines for Hard Real-Time SDL Systems
Thomas Kolloch · 2002
Hard real-time system design requires both, a methodology that allows to control the increasing functional complexity and additionally an a-priori proof that all timing requirements will be met even in worst case situations. This work introduces message based earliest deadline first scheduling (MEDF scheduling) as a predictable model of computation for the "Specification and Description Language" SDL. Relying on this improved semantics, a real-time system's implementation and its worst case timing behaviour can be automatically derived on the basis of its SDL system specification by one strike.