Abstract
The use of the global cyclic scheduling discipline in distributed real-time systems guarantees that the response time requirements of the environment are always met. The global scheduling discipline uses cyclic scheduling plans for its decisions. These plans are determined off-line. During the development phase of a real-time system deadlines are checked and the scheduling plans are generated. Software tools support the computation of the scheduling plans. In this paper we discuss the global cyclic scheduling discipline and present a software system to support the development of distributed real-time systems. Our software system consists of a specificaton tool for the real-time software and a schedule computation tool. Three different algorithms for the computation of the scheduling plans are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Herrtwich, R.G. 1989. Echtzeit. Informatik Spektrum, 12: 93–96.
Leung, J.Y.-T., and Merril, M.L. 1980. A Note on Preemptive Scheduling of Periodic Real-Time Tasks. Information Processing Letters, 11: 115–118.
Lawler, E.L., and Martel, C.U. 1981. Scheduling Periodically Occurring Tasks on Multiple Processors. Information Processing Letters, 12: 9–12.
Kopetz, H. 1986. Scheduling in Distributed Real-Time Systems. In Proc. Advanced Seminar on Real-Time Local Area Networks, Bandol, France.
Kopetz, H., Damm, A., Koza, C., and Mulozzani, M. 1989. Distributed Fault-Tolerant Real-Time Systems: The Mars Approach. IEEE Micro, 25–40.
Ramamritham, K., and Stankovic, J.A. 1984. Dynamic Task Scheduling in Hard Real-Time Distributed Systems. IEEE Software, 65–75.
Stankovic, J.A., Ramamritham, K. and Cheng, S. 1985. Evaluation of a Flexible Task Scheduling Algorithm for Distributed Hard Real-Time Systems. IEEE Transactions on Computers, c-34: 1130–1143.
Mok, A. 1983. Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment. Massachusetts Institute of Technology, Ph.D. Thesis.
Damm, A. 1987. Kernel Aspects of the Distributed Real-Time Operating System of MARS. Technical University of Vienna, Vienna, Austria, Research Report No. 6/87.
Jensen, E.D., Locke, C.D., and Tokuda, H. 1985. A Time-Driven Scheduling Model for Real-Time Operating Systems. In Proc. IEEE Real-Time Systems Symposium, San Diego, pp. 112–122.
Tokuda, H., Wendorf, J.W., and H.-Y. Wang. 1987. Implementation of a Time-Driven Scheduler for Real-Time Operating Systems. In Proc. IEEE Real-Time Systems Symposium, San Jose, CA, pp. 271–280.
Puschner, P., and Koza, C. 1989. Calculating the Maximum Execution Time of Real-Time Programs. The Journal of Real-Time Systems, 1: 159–176.
Lin, K.J., and Lin, M.-J. 1988. Enhancing Availability in Distributed Real-Time Databases. ACM SIGMOD RECORD, 17: 34–42.
Barr, A., and Feigenbaum, E.A. 1981. The Handbook of Artificial Intelligence Volume I. Los Altos, California: William Kaufmann.
Liu, C.L., and Layland, J.W. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. JACM, 20: 46–61.
Korf, R.E. 1985. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence, 27: 97–109.
Author information
Authors and Affiliations
Additional information
The research work was supported as an Ernst-von-Siemens scholarship of the Siemens AG.
Rights and permissions
About this article
Cite this article
Agne, R. Global cyclic scheduling: A method to guarantee the timing behavior of distributed real-time systems. The Journal of Real-Time Systems 3, 45–66 (1991). https://doi.org/10.1007/BF00365392
Issue Date:
DOI: https://doi.org/10.1007/BF00365392