Exact Analysis of TDMA with Slot Skipping
Ref: HURRAY-TR-070608 Publication Date: 21 to 24, Aug, 2007
Exact Analysis of TDMA with Slot SkippingRef: HURRAY-TR-070608 Publication Date: 21 to 24, Aug, 2007
Consider a communication medium shared among a set of computer nodes; these computer nodes issue messages that are requested to be transmitted and they must finish their transmission before their respective deadlines. TDMA/SS is a protocol that solves this problem; it is a specific type of Time Division Multiple Access (TDMA) where a computer node is allowed to skip its time slot and then this time slot can be used by another computer node. We present an algorithm that computes exact queuing times for TDMA/SS in conjunction with Rate-Monotonic (RM) or Earliest-Deadline-First (EDF).
13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'07), IEEE, pp 63-72.
Daegu, South Korea.
WOS ID: 000250109000008.
Record Date: 1, Mar, 2007
Short links for this page: www.cister.isep.pt/docs/10_1109_rtcsa_2007_38 www.cister.isep.pt/docs/000250109000008 www.cister.isep.pt/docs/hurray_tr_070608 www.cister.isep.pt/docs/376