A performance analysis of distributed hard-real time applications

Abstract

In distributed hard real-time applications there is a need for temporal analysis to evaluate and optimise a design with respect to the deadlines. The key method is the scheduling analysis of such applications, which means the schedulability not only of its tasks but of its messages too. The authors present a schedulability analysis which allows one to determine the timing parameters of messages and to update those of tasks. Given an initial task set characterised by temporal attributes and network interactions, this methodology permits one to produce valid execution sequences and to evaluate the relevant timing factors. Simulation results done with CAN and FDDI protocols are deduced.