Abstract
In the paper we will show the integration of the real-time calculus with event driven real-time analysis like the periodic or the sporadic task model. For the event-driven real-time analysis, flexible approximative analysis approaches where proposed to allow an efficient real-time analysis. We will provide an easy but powerful approximative description model for the real-time calculus. In contrary to the existing description model the degree of approximation is chooseable allowing a more accurate description.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Chakraborty, S., Künzli, S., Thiele, L.: Performance evaluation of network processor architectures: Combining simulation with analytical estimations. Computer Networks 41(5), 641–665 (2003)
Thiele, L., Chakraborty, S., Gries, M., Künzli, S.: Design space exploration for the network processor architectures. In: 1st Workshop on Network Processors at the 8th International Symposium for High Performance Computer Architectures (2002)
Cruz, R.: A calculus for network delay. IEEE Transactions on Information Theory 37, 114–141 (1991)
Parekh, A., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated service networks. IEEE/ACM Transactions on Networking (3), 344–357 (1993)
Künzli, S.: Efficient Design Space Exploration for Embedded Systems. PhD thesis, ETH Zürich No. 16589 (2006)
Albers, K., Slomka, F.: Efficient feasibility analysis for real-time systems with edf-scheduling. In: Proceedings of the Design Automation and Test Conference in Europa (DATE 2005), pp. 492–497 (2005)
Richter, K.: Compositional Scheduling Analysis Using Standart Event Models. Dissertation, TU Braunschweig (2005)
Richter, K., Ernst, R.: Event model interfaces for heterogeneous system analysis. In: Proceedings of the Design Automation and Test Conference in Europe, DATE 2002 (2002)
Gresser, K.: An event model for deadline verification of hard real-time systems. In: Proceedings of the 5th Euromicro Workshop on Real-Time Systems (1993)
Albers, K., Bodmann, F., Slomka, F.: Hierachical event streams and event dependency graphs. In: Proceedings of the 18th Euromicro Conference on Real-Time Systems (ECRTS 2006), pp. 97–106 (2006)
Albers, K., Slomka, F.: An event stream driven approximation for the analysis of real-time systems. In: IEEE Proceedings of the 16th Euromicro Conference on Real-Time Systems, Catania, pp. 187–195 (2004)
Baruah, S.: Dynamic- and static-priority scheduling of recurring real-time tasks. International Journal of Real-Time Systems 24, 98–128 (2003)
Baruah, S., Mok, A., Rosier, L.: Preemptive scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the Real-Time Systems Symposium, pp. 182–190 (1990)
Albers, K., Bodmann, F., Slomka, F.: Run-time efficient feasibility analysis of uni-processor systems with static priorities. In: Poceedings of the International Embedded Systems Symposium, IESS 2007 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Albers, K., Slomka, F. (2009). Event Stream Calculus for Schedulability Analysis. In: Rettberg, A., Zanella, M.C., Amann, M., Keckeisen, M., Rammig, F.J. (eds) Analysis, Architectures and Modelling of Embedded Systems. IESS 2009. IFIP Advances in Information and Communication Technology, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04284-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-04284-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04283-6
Online ISBN: 978-3-642-04284-3
eBook Packages: Computer ScienceComputer Science (R0)