Abstract
In a previous work, we propose a technique to decide feasability of periodic hard real-time systems based on finite automata. Here, associating generating functions (whose role is “to predict the future”) to a finite automaton, we extend this technique to hard sporadic tasks, independent or interdependent with the periodic tasks.
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.
Similar content being viewed by others
References
L. Aceto, P. Bouyer, A. Burgue, and K. G. Larsen. The power of reachability testing for timed automata. In Proc. of 18th Conf. Found. of Software Technology and Theor. Comp. Sci., LNCS 1530, pages 245–256. Springer-Verlag, December 1998.
N.C. Audsley, A. Burns, R.I. David, K.W. Tindell, and A. J. Welling. Fixed priority preemptive scheduling: an historical perspective. The journal of Real-Time Systems, 8:173–198, 1995.
A. Arnold. Finite transition systems. Prentice Hall, 1994.
T. P. Baker. Stack-based scheduling of real-time processes. the Journal of Real-Time Systems, 3:67–99, 1991.
G. C. Buttazzo. Hard Real-Time Computing Systems. Kluwer Academic Publishers, 1997.
N. Chomsky and M. P. Schützenberger. The algebraic theory of context-free languages. Computer Programming and Formal Systems, pages 118–161, 1963.
E. W. Dijkstra. Cooperating sequential processes. Technical Report EWD-123, Technological University Eindhoven, 1965.
S. Eilenberg. Automata Languages and machines, volume A. Academic Press, 1976.
E. Grolleau and A. Choquet-Geniet. Scheduling real-time systems by means of petri nets. In Proc. of 25th Workshop on Real-Time Programming, pages 95–100. Universidad Politécnica de Valencia, 2000.
D. Geniet. Validation d’applications temps-réel á contraintes strictes á l’aide de langages rationnels. In RTS’2000, pages 91–106. Teknea, 2000.
E. Grolleau. Ordonnancement Temps-Réel Hors-Ligne Optimal á l’Aide de Réseaux de Petri en Environnement Monoprocesseur et Multiprocesseur. PhD thesis, Univ. Poitiers, 1999.
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.
J. Y. T. Leung and M.L. Merill. A note on preemptive scheduling of periodic real-time tasks. Information Processing Letters, 11(3):115–118, 1980.
A. K. Mok. Fundamental Design Problems for the Hard Real-Time Environments. PhD thesis, MIT, 1983.
M. Silly, H. Chetto, and N. Elyounsi. An optimal algorithm for guaranteeing sporadic tasks in hard real-time systems. In Proc. of SPDS’90, pages 578–585, 1990.
A. Stankovic, M. Spuri, K. Ramamritham, and G. C. Buttazzo. Deadline Scheduling for Real-Time Systems. Kluwer Academic Press, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubernard, JP., Geniet, D. (2002). Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions. In: Watson, B.W., Wood, D. (eds) Implementation and Application of Automata. CIAA 2001. Lecture Notes in Computer Science, vol 2494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36390-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-36390-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00400-4
Online ISBN: 978-3-540-36390-3
eBook Packages: Springer Book Archive