Abstract
Many network protocols rely on temporal partitions to provide isolation between different nodes (TDMA slots) or different traffic classes (multi-phase cyclic frameworks). Typically, the duration of the slots or phases is not correlated with the duration of packet transmissions, which is variable and non-preemptive. Thus, it is possible that the limit of the slot or phase be overrun by an on-going packet transmission or, if this cannot be tolerated, idle-time must be inserted at the end of the slot or phase whenever a packet does not fit in. Nevertheless, both situations lead to scheduling anomalies in which the worst-case network delay does not occur necessarily with the synchronous release of all other packets, or just the higher priority ones. This paper highlights two such anomalies showing their origin and indicating that, in such circumstances, it is not possible to determine the worst-case network delay with exactitude in the general ease. However, it is still possible to upper bound the network delay and the paper shows non-optimal solutions for those cases.
Chapter PDF
Similar content being viewed by others
REFERENCES
L. Almeida, J.A. Fonseca (2001). “Analysis of a Simple Model for Non-Preemptive Blocking-Free Scheduling”. In Proceedings of the 13th Euromicro Conference on Real-Time Systems, Delft, The Netherlands.
L. Almeida, P. Pedreiras, J.A. Fonseca (2002). “The FTT-CAN Protocol: Why and How”. In IEEE Transactions on Industrial Electronics, 49(6).
L. Almeida, P. Pedreiras (2004). “Scheduling within temporal partitions: response-time analysis and server design”, ACM Int Conf on Embedded Software (EMSOFT 2004), Pisa.
G. Buttazzo (2002). “Scalable Applications for Energy-Aware Processors”. 2nd Int. Conf. on Embedded Software (EMSOFT 2002), Grenoble, France, LNCS 2491, Springer-Verlag.
S. Cavalieri, S. Monforte, E. Tovar, F. Vasques (2002). Multi-Master Profibus-DP Modelling and Worst-Case Analysis Based Evaluation. 15th IFAC World Congress, Barcelona, Spain.
Y.-S. Chen, L.-P. Chang, T.-W. Kuo, A.K. Mok (2005). “Real-time task scheduling anomaly: observations and prevention”, ACM Symp on Applied Computing, Santa Fe, New Mexico.
R.I. Davis, A. Bums (2005). “Hierarchical Fixed Priority Scheduling”, Proceedings of the 26th IEEE Real-Time Systems Symposium (RTSS). Miami, USA.
L. Ferreira (2005). “A Multiple Logical Ring Approach to Real-time Wireless-enabled PROFIBUS Networks”. PhD Thesis, Universidade do Porto, Portugal.
R. Graham (1976). “Bounds on the performance of scheduling algorithms”. In E. G. Coffman,Jr., ed, Computer and Job-Shop Scheduling Theory. John Wiley & Sons, New York.
Giuseppe Lipari, Enrico Bini (2004). “A Methodology for Designing Hierarchical Scheduling Systems”. In Journal of Embedded Computing 1(2).
C. L. Liu, J. W. Layland (1973). “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment”. In Journal of the ACM, 20(1).
A. Mok (2000). “Scalability of Real-Time Applications”. Keynote address at the 7th International Conference on Real-Time Computing Systems and Applications.
I. Shin, I. Lee (2003). “Periodic Resource Model for Compositional Real-Time Guarantees”. Proceedings of 24th IEEE Real-Time Systems Symposium (RTSS), Cancun, Mexico.
J. A. Stankovic, M. Spuri, M. Di Natale, G. C. Buttazzo (1995). “Implications of Classical Scheduling Results for Read-Time Systems”. In Computer, June, 1995, pp. 1625.
E. Tovar, F. Vasques (2000). “Distributed Computing for the Factory-floor: a Real-Time Approach Using WolrdFIP Networks”, Computers in Industry, 44(1), Elsevier Science.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Almeida, L., Pedreiras, P., Marau, R. (2006). Traffic Scheduling Anomalies in Temporal Partitions. In: Kleinjohann, B., Kleinjohann, L., Machado, R.J., Pereira, C.E., Thiagarajan, P.S. (eds) From Model-Driven Design to Resource Management for Distributed Embedded Systems. DIPES 2006. IFIP International Federation for Information Processing, vol 225. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39362-9_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-39362-9_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-39361-2
Online ISBN: 978-0-387-39362-9
eBook Packages: Computer ScienceComputer Science (R0)