Analyzing TDMA with Slot Skipping

  • Authors:
  • B. Andersson;E. Tovar;N. Pereira

  • Affiliations:
  • Polytechnic Institute of Porto;Polytechnic Institute of Porto;Polytechnic Institute of Porto

  • Venue:
  • RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a schedulability analysis for a particular class of time division multiple access (TDMA) networks, which we label as TDMA/SS. SS stands for slot skipping, reflecting the fact that a slot is skipped whenever it is not used. Hence, the next slot can start earlier in benefit of hard real-time traffic. In the proposed schedulability analysis, we assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to a rate monotonic policy (as an example). We present the analysis in two steps. Firstly, we address the case where a node is only permitted to transmit a maximum of one message per TDMA cycle. Secondly, we generalise the analysis to the case where a node is assigned a budget of messages per TDMA cycle it may transmit. A simple algorithm to assign budgets to nodes is also presented.