NEW METHOD TO CALCULATE WORST-CASE COMMUNICATION DELAY IN DISTRIBUTED REAL-TIME SYSTEMS

Distributed real-time system consists of many tasks on different processors communicating witheach other. The communication between these tasks must occur in bounded time. In our thesis weare considering a holistic approach to estimate the end-to-end delays between two processorscommunicating with each other. For both tasks scheduled by fixed priority and dynamic priority,the system model considered is time token passing ring. The method is described to calculateworst-case communication delay of the message sent by certain tasks over the network. Once theworst-case communication delay of the message is obtained, and all required parameters areprovided i.e. deadline of the message, transmission time of the packet etc, one can figure out howmany messages will successfully meet their deadline. Thus this will enable us to selectappropriate algorithm according to system requirement.