Analysing TDMA with Slot Skipping
Ref: HURRAY-TR-081103 Publication Date: Nov 2008
Analysing TDMA with Slot SkippingRef: HURRAY-TR-081103 Publication Date: Nov 2008
Distributed real-time systems, such as factory automation systems, require that computer nodes communicate with a known and low bound on the communication delay. This can be achieved with traditional Time-Division-Multiple-Access (TDMA). But improved flexibility and simpler upgrades are possible through the use of TDMA with Slot-Skipping (TDMA/SS), meaning that a slot is skipped whenever it is not used and consequently the slot after the skipped slot starts earlier. We propose a schedulability analysis for TDMA/SS. We assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to Deadline Monotonic. Firstly, we present a non-exact (but fast) analysis and then, at the cost of computation time, we also present an algorithm that computes exact queuing times.
Published in Transactions on Industrial Informatics (TII), IEEE, Volume 4, Issue 4, pp 225-236.
WOS ID: 000262989100004.