skip to main content
10.1145/2392987.2392994acmotherconferencesArticle/Chapter ViewAbstractPublication PagesrtnsConference Proceedingsconference-collections
research-article

Combining network calculus and scheduling theory to improve delay bounds

Published: 08 November 2012 Publication History

Abstract

Nowadays embedded real-time systems are often large distributed communicating systems, and the need for bounds on worst-case execution times (WCET) now includes the need of bound on worst-case network traversal time (WCTT). Network calculus is one method used to compute such bounds, and has been successfully applied on Airbus A380 [13]. Nevertheless, the computed bounds could be pessimistic. On the other hand, the scheduling theory can often compute tight bounds, but with algorithms of complexity not able to deal with too large systems.
In this paper, the scheduling theory is used to compute tight constraints on flows produced by computers, improving the inputs to the network calculus method and consequently compute better (i.e. lower) bounds.
To do so, scheduling methods must be adapted to approach the best and worst date of message production, and some results on network calculus must be written to go from the scheduling method on a finite interval to a general long term constraint.

Supplementary Material

JPG File (p51-boyer.jpg)
Arrivals curves, computed with different methods

References

[1]
K. Altisen and M. Moy. ac2lus: Bringing SMT-solving and abstract interpretation techniques to real-time calculus through the synchronous language Lustre. In Proc. of the 22nd Euromicro Conference on Real-Time Systems (ECRTS), Brussels, Belgium, Jully 2010.
[2]
K. Altisen and M. Moy. Causality closure for a new class of curves in real-time calculus. In Proc. of the 1st Int. Workshop on Worst-Case Traversal Time (WCTT'2011), WCTT '11, pages 3--10, New York, NY, USA, 2011. ACM.
[3]
A. Bouillard and E. Thierry. An algorithmic toolbox for network calculus. Discrete Event Dynamic Systems, 17(4), october 2007.
[4]
M. Boyer and D. Doose. Collaboration entre méthode d'ordonnancement et calcul réseau. In Actes des 2èmes Journées du GdR Génie de la programmation et du logiciel (GdR GPL 2010), Pau, France, 2010.
[5]
M. Boyer and D. Doose. Combining network calculus and scheduling theory to improve delay boudns. Technical Report RT 5/14053, ONERA, Dec. 2010.
[6]
M. Boyer and C. Fraboul. Tightening end to end delay upper bound for AFDX network with rate latency FCFS servers using network calculus. In Proc. of the 7th IEEE Int. Workshop on Factory Communication Systems Communication in Automation (WFCS 2008), pages 11--20. IEEE, May 21-23 2008.
[7]
C.-S. Chang. Performance Guarantees in communication networks. Telecommunication Networks and Computer Systems. Springer, 2000.
[8]
R. L. Cruz. A calculus for network delay, part I: Network elements in isolation. IEEE Transactions on information theory, 37(1):114--131, January 1991.
[9]
R. L. Cruz. A calculus for network delay, part II: Network analysis. IEEE Transactions on information theory, 37(1):132--141, January 1991.
[10]
H. Dierks, A. Metzner, and I. Stierand. Efficient model-checking for real-time task networks. In Proc. of the 6th Int. Conference on Embedded Software and Systems (ICESS'09), Zhejiang, China, 2009.
[11]
F. Frances, C. Fraboul, and J. Grieu. Using network calculus to optimize AFDX network. In Proc. of the 3thd European congress on Embedded Real Time Software (ERTS06), Toulouse, January 2006.
[12]
K. Gresser. An event model for deadline verification of hard real-time systems. In Proc. of 5th Euromicro Workshop on Real-Time Systems, june 1993.
[13]
J. Grieu. Analyse et évaluation de techniques de commutation Ethernet pour l'interconnexion des systèmes avioniques. PhD thesis, Institut National Polytechnique de Toulouse (INPT), Toulouse, 2004.
[14]
J. Grieu, F. Frances, and C. Fraboul. Preuve de déterminisme d'un réseau embarqué avionique. In Actes du Colloque Francophone sur l'Ingenierie des Protocoles (CFIP 2003), Paris, Octobre 2003.
[15]
M. Joseph and P. Pandya. Finding Response Times in a Real-Time System. The Computer Journal, 29(5):390--395, 1986.
[16]
K. Lampka, S. Perathoner, and L. Thiele. Analytic real-time analysis and timed automata: A hybrid methodology for the performance analysis of embedded real-time systems. Design Automation for Embedded Systems, 14(3):193--227, 2010.
[17]
M. Lauer, J. Ermont, C. Pagetti, and F. Boniol. Analysing end-to-end functionnal delays on an IMA platform. In Proc. of the 4th Int. Symp. On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA 2010), LNCS. Springer, 2010.
[18]
J.-Y. Le Boudec and P. Thiran. Network Calculus, volume 2050 of LNCS. Springer Verlag, 2001. http://lrcwww.epfl.ch/PS_files/NetCal.htm.
[19]
J. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrarydeadlines. Proc. of the 11th Real-Time Systems Symposium, 1990.
[20]
J. Lehoczky, L. Sha, and Y. Ding. The rate monotonic scheduling algorithm: exact characterization andaverage case behavior. Real Time Systems Symposium, 1989., Proceedings, 1989.
[21]
J. Y. T. Leung and J. Whitehead. On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2(4), 1982.
[22]
X. Li, J.-L. Scharbarg, and C. Fraboul. Improving end-to-end delay upper bounds on an AFDX network by integrating offsets in worst-case analysis. In Proc. of the 15th IEEE Conference on Emerging Technologies and Factory Automation (ETFA 2010), pages 1--8, Bilbao, Spain, September 2010.
[23]
C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46--61, 1973.
[24]
S. Martin and P. Minet. The trajectory approach for the end-to-end response times with non-preemptive FP/EDF. In Proc. of the Int. Conf. on Software Engineering Research and Applications (SERA'04), volume 3647 of LNCS, pages 229--247. Springer, 2004.
[25]
S. Perathoner, E. Wandeler, L. Thiele, A. Hamann, S. Schliecker, R. Henia, R. Racu, R. Ernst, and M. G. Harbour. Influence of different system abstractions on the performance analysis of distributed real-time systems. In Proc. of the 7th ACM & IEEE Int. Conf. on Embedded software (EMSOFT'07), pages 193--202, New York, NY, USA, 2007. ACM.
[26]
K. Richter and R. Ernst. Event model interfaces for heterogeneous system analysis. In Proc. of the conf. on Design, Automation and Test in Europe (DATE'2002), pages 506--513, 2002.
[27]
S. Schliecker, J. Rox, M. Ivers, and R. Ernst. Providing accurate event models for the analysis of heterogeneous multiprocessor systems. In Proc. of the 6th IEEE/ACM/IFIP Int. Conf. on Hardware/Software codesign and system synthesis (CODES'08). ACM, 2008.
[28]
K. Tindell. An extendible approach for analyzing fixed priority hard real-time tasks. Technical Report YCS189, 1992.
[29]
K. Tindell and J. Clark. Holistic schedulability analysis for distributed hard real-time systems. Microprocess. Microprogram, 40(2-3):117--134, 1994.

Cited By

View all
  • (2024)Blocking-Waived Estimation: Improving the Worst-Case End-To-End Delay Analysis in Switched Ethernet2024 IEEE 49th Conference on Local Computer Networks (LCN)10.1109/LCN60385.2024.10639705(1-9)Online publication date: 8-Oct-2024
  • (2024)Scaling, Packetizers and Aggregation in Network Calculus2024 IEEE 29th International Conference on Emerging Technologies and Factory Automation (ETFA)10.1109/ETFA61755.2024.10710819(1-8)Online publication date: 10-Sep-2024
  • (2018)ReferencesDeterministic Network Calculus10.1002/9781119440284.refs(303-315)Online publication date: 26-Oct-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
RTNS '12: Proceedings of the 20th International Conference on Real-Time and Network Systems
November 2012
216 pages
ISBN:9781450314091
DOI:10.1145/2392987
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • University of Lorraine: University of Lorraine
  • INRIA: Institut Natl de Recherche en Info et en Automatique
  • GDR ASR: GDR Architecture, Systèmes et Réseaux

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 November 2012

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

RTNS '12
Sponsor:
  • University of Lorraine
  • INRIA
  • GDR ASR

Acceptance Rates

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)9
  • Downloads (Last 6 weeks)1
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Blocking-Waived Estimation: Improving the Worst-Case End-To-End Delay Analysis in Switched Ethernet2024 IEEE 49th Conference on Local Computer Networks (LCN)10.1109/LCN60385.2024.10639705(1-9)Online publication date: 8-Oct-2024
  • (2024)Scaling, Packetizers and Aggregation in Network Calculus2024 IEEE 29th International Conference on Emerging Technologies and Factory Automation (ETFA)10.1109/ETFA61755.2024.10710819(1-8)Online publication date: 10-Sep-2024
  • (2018)ReferencesDeterministic Network Calculus10.1002/9781119440284.refs(303-315)Online publication date: 26-Oct-2018
  • (2017)Evaluation of admissible CAN bus load with weak synchronization mechanismProceedings of the 25th International Conference on Real-Time Networks and Systems10.1145/3139258.3139261(277-286)Online publication date: 4-Oct-2017
  • (2017)Extending Real-Time Analysis for Wormhole NoCsIEEE Transactions on Computers10.1109/TC.2017.268639166:9(1532-1546)Online publication date: 1-Sep-2017
  • (2013)Freshness and Reactivity Analysis in Globally Asynchronous Locally Time-Triggered SystemsNASA Formal Methods10.1007/978-3-642-38088-4_7(93-107)Online publication date: 2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media