A WORST-CASE RESPONSE TIME ANALYSIS ALGORITHM OF MESSAGES WITH DEFERED PREEMPTION

In a distributed real-time system, worst-case response time analysis of messages is very important to system schedulability analysis. Proposed in this paper is a worst-case response time analysis algorithm of messages with deferred preemption in a distributed real-time system using the TDMA protocol. By solving a correctness problem existing in former algothrims, this algorithm can precisely derive the worst-case response time of messages.