Abstract
The paper addresses worst case performance analysis of non preemptive static scheduling priority scheduling within the network calculus theory. Previous studies have been done, each one generalizing some other [8,1,7,3,10], needing weaker hypotheses or improving accuracy of results. This paper presents a very general results, with an accuracy that appear, on preliminary examples, as good as all other one.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bouillard, A., Jouhet, L., Thierry, E.: Service curves in network calculus: dos and don’ts. Rapport de recherche INRIA 7094, INRIA (Novembre 2009)
Cheng-Shang, C.: Performance Guarantees in Communication Networks. Springer, Heidelberg (2000) ISBN: 1-85233-226-3
Chokshi, D.B., Bhaduri, P.: Modeling fixed priority non-preemptive scheduling with real-time calculus. In: RTCSA 2008: Proc. of the 2008 14th IEEE Int. Conf. on Embedded and Real-Time Computing Systems and Applications. IEEE Computer Society, Washington, DC (2008)
Cruz, R.L.: A calculus for network delay, part I: Network elements in isolation. IEEE Transaction on Information Theory 37(1), 114–131 (1991)
Cruz, R.L.: A calculus for network delay, part II: Network analysis. IEEE Transaction on Information Theory 37(1), 132–141 (1991)
Davis, R.I., Burns, A., Bril, R.J., Lukkien, J.J.: Controller area network (CAN) schedulability analysis: Refuted (2007) (revisited and revised)
Haid, W., Thiele, L.: Complex task activation schemes in system level performance analysis. In: ESWeek 2007: Proc. of the 5th IEEE/ACM Int. Conf. on Hardware/Software Codesign and System Synthesis, Salzburg, Austria, September 30-October 03, pp. 173–178. ACM, New York (2007)
Le Boudec, J.Y., Thiran, P.: Network Calculus. LNCS, vol. 2050, pp. 3–81. Springer, Heidelberg (2001)
Lenzini, L., Mingozzi, E., Stea, G.: Delay bounds for FIFO aggegates: a case study. Computer Communications 28, 287–299 (2004)
Mangoua Sofack, W., Boyer, M.: Non preemptive static priority with network calculus. In: Proc. of the 16th IEEE Int. Conf. on Emerging Technologies and Factory Automation (ETFA 2011) (September 2011)
Perathoner, S., Wandeler, E., Thiele, L., Hamann, A., Schliecker, S., Henia, R., Racu, R., Ernst, R., Gonzlez Harbour, M.: Influence of different abstractions on the performance analysis of distributed hard real-time systems. Design Automation for Embedded Systems 13, 27–49 (2009)
Pollex, V., Lipskoch, H., Slomka, F., Kollmann, S.: Runtime improved computation of path latencies with the real-time calculus. In: Proc. of the 1st International Workshop on Worst-Case Traversal Time, WCTT 2011, pp. 58–65. ACM (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mangoua Sofack, W., Boyer, M. (2012). Non Preemptive Static Priority with Network Calculus: Enhancement. In: Schmitt, J.B. (eds) Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance. MMB&DFT 2012. Lecture Notes in Computer Science, vol 7201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28540-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-28540-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28539-4
Online ISBN: 978-3-642-28540-0
eBook Packages: Computer ScienceComputer Science (R0)