Abstract
Real-time schedulers are modelled by finite-state transition systems using FIFO queues as auxiliary memory. The intuitive notion of hard real time is related to the definition of quasi-real-time behaviour of an automaton. Then, starting with simple schedulers for independent tasks, a modular approach to the design of schedulers (FIFO, static priority based, preemptive, dynamic priorities) is presented. This is based on recent results on recognition power and closure properties of quasi-real-time queue automata w.r.t. intersection, shuffle and reverse homomorphism. The treatment of readers-writers schedulers is compared with recent proposals based on intersections of context-free languages. Possible developments are in the conclusion.
This work was supported by Italian MURST 60% and by ESPRIT-BRA project ASMICS.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Brandenburg F.J. “On the intersections of stacks and queues”, Theor. Comp. Sc., 58, 69–80, 1988.
Breveglieri L. et al. “Stacks, queues and their languages”, Rept.N∘. 90053, Dipt. Elettronica, Politecnico di Milano, 1990.
Cherubini A., et al. “Breadth and depth grammars and dequeue automata”, Foundations of Comp. Sc., 1, 3, 1990, 219–232.
Cherubini A. et al. “Quasi-real-time FIFO automata, breadth-first grammars and their relations”, Theor. Comp. Sc., 1991.
Cooling J.E. Software design for real-time systems, Chapman and Hall, London 1990.
Courtois P.J., Heyman R. and Parnas D.I. “Concurrent control with readers and writers”, Comm.ACM, 14, 1971, 667–668.
Hemmendinger D. “Specifying Ada server tasks with executable formal grammars”, IEEE Trans.SE, 16, 7, Jul. 1990, 741–754.
Herrtwich R.G. “An introduction to real-time schedulers”, Rept. N∘90-035, Int. Comp. Sc. Inst., July, 1990.
Liu C.L. and Layland J.W. “Scheduling algorithms for multiprogramming in a hard-real-time environment”, Journ. ACM, 20, 1, Jan. 1973, 46–61.
Manacher G.K. “Production and stabilization of real-time task schedules”, Journ. ACM, 14, 3, Jul. 1967, 439–465.
Vauquelin B. and Franchi Zannettacci P. “Automates à file”, Theor. Comp. Sc., 11, 221–225, 1980.
Vollmar R. “Ueber einem Automaten mit Pufferspeicherung”, Computer, 5, 50–70, 1970.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Breveglieri, L., Cherubini, A., Crespi-Reghizzi, S. (1991). Real-time scheduling by queue automata. In: Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1992. Lecture Notes in Computer Science, vol 571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55092-5_8
Download citation
DOI: https://doi.org/10.1007/3-540-55092-5_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55092-1
Online ISBN: 978-3-540-46692-5
eBook Packages: Springer Book Archive