loading...
Exact Analysis of TDMA with Slot Skipping
Daegu, Korea August 21-August 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2007.3813th IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Nuno Pereira, Eduardo Tovar, Bjorn Andersson, "Exact Analysis of TDMA with Slot Skipping," Real-Time Computing Systems and Applications, International Workshop on, pp. 63-72, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2007.38,
author = {Nuno Pereira and Eduardo Tovar and Bjorn Andersson},
title = {Exact Analysis of TDMA with Slot Skipping},
journal ={Real-Time Computing Systems and Applications, International Workshop on},
volume = {0},
year = {2007},
issn = {1533-2306},
pages = {63-72},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2007.38},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Real-Time Computing Systems and Applications, International Workshop on
TI - Exact Analysis of TDMA with Slot Skipping
SN - 1533-2306
SP63
EP72
A1 - Nuno Pereira,
A1 - Eduardo Tovar,
A1 - Bjorn Andersson,
PY - 2007
KW - null
VL - 0
JA - Real-Time Computing Systems and Applications, International Workshop on
ER -
 
Nuno Pereira, Polytechnic Institute of Porto, Portugal
Eduardo Tovar, Polytechnic Institute of Porto, Portugal
Bjorn Andersson, Polytechnic Institute of Porto, Portugal
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).
Citation:
Nuno Pereira, Eduardo Tovar, Bjorn Andersson, "Exact Analysis of TDMA with Slot Skipping," rtcsa, pp.63-72, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.