Abstract
In a distributed hard real-time system, communications between tasks on different processors must occur in bounded time. The inevitable communication delay is composed of both the delay in transmitting a message on the communications media, and also the delay in delivering the data to the destination task. This paper derives schedulability analysis bounding the media access delay and the delivery delay. Two access protocols are considered: a simple timed token passing approach, and a real-time priority broadcast bus. A simple delivery approach is considered where the arrival of a message generates an interrupt—the so-called ‘on demand’ approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
ISO/DIS 11898. 1992. Road vehicles—interchange of digital information—controller area network (CAN) for high speed communication.
Agrawal, G., Chen, B., Zhao, W., and Davari, S. 1991. Architecture impact of FDDI network on scheduling hard real time traffic.Workshop on Architectural Aspects of Real Time Systems.
Audsley, N. C. 1991. Optimal priority assignment and feasibility of static priority tasks With arbitrary start times. YCS164, Department of Computer Science, University of York.
Audsley, N., Tindell, K., and Burns, A. 1993a. The end of the line for static cyclic scheduling?Proceedings of the Fifth Euromicro Workshop on Real-time Systems. IEEE Computer Society Press, pp. 36–41.
Audsley, N. C., Burns, A., Richardson, M. F., and Wellings, A. J. 1991. Hard real-time scheduling: The deadline monotonic approach.Proceedings 8th IEEE Workshop on Real-Time Operating Systems and Software.
Audsley, N., Burns, A., Richardson, M., Tindell, K., and Wellings, A. 1993b. Applying new scheduling theory to static priority pre-emptive schedulingSoftware Engineering Journal September.
Burns, A., Nicholson, M., Tindell, K., and Zhang, N. 1993a. Allocating and scheduling hard real-time tasks on a point-to-point distributed system.Proceedings of the workshop on Parallel and Distributed Real-Time Systems pp. 11–20.
Burns, A., Wellings, A. J., Bailey, C. M., and Fyfe, E. 1993b. The Olympus attitude and orbital control system: A case study in hard real-time system design and implementation. YCS 190, Department of Computer Science, University of York.
Damm, A., Reisinger, W., Schwabl, W., and Kopetz, H. 1989. The real-time operating system of MARS.ACM Operating Systems Review 23(3) (Special Issue): 141–151.
Davis, R., Tindell, K., and Burns, A. 1993. Scheduling slack time in fixed priority pre-emptive systems.Proceedings 14th IEEE Real-Time Systems Symposium.
Demirbas, K. 1989. Distributed sensor data fusion with binary decision trees.IEEE Transactions on Aerospace and Electronic Systems 25(5): 643.
Gerber, R., and Hong, S. 1993. Semantic-based compiler transformations for enhanced schedulability. CS-TR-3071, Department of Computer Science, University of Maryland.
Joseph, M., and Pandya, P. 1986. Finding response times in a real-time system.BCS Computer Journal 5(29): 390–395.
Lehoczky, J. P. 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines.Proceedings 11th IEEE Real-Time Systems Symposium pp. 201–209.
Lehoczky, J., Sha, L., and Ding, Y. 1989. The rate monotonic scheduling algorithm: Exact characterisation and average case behaviour.Proceedings of the 11th Real-Time Systems Symposium.
Leung, J. Y. T., and Whitehead, J. 1982. On The complexity of fixed-priority scheduling of periodic real-time tasks.Performance Evaluation 4(2): 237–250.
Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment.Journal of the ACM 20(1): 46–61, (1973).
Pleinevaux, P. 1992. An improved hard real-time scheduling for the IEEE 802.5.Real-Time Systems 4(2): 99–112.
Rajkumar, R. 1990. Real-time synchronisation protocols for shared memory multiprocessors.Proceedings 10th IEEE International Conference on Distributed Computing Systems, Paris.
Sha, L., Rajkumar, R., and Lehoczky, J. 1990. Priority inheritance protocols: An approach to real-time synchronisation.IEEE Transactions on Computers 39(9): 1175–1185.
Strosnider, J. K., Marchok, T., and Lehoczky, J. 1988. Advanced real-time scheduling using the IEEE 802.5 token ring.Proceedings of the 9th IEEE Real-Time Systems Symposium pp. 42–52.
Tindell, K., and Clark, J. 1994. Holistic schedulability analysis for distributed hard real-time systems.Microprocessors and Microprogramming 40: 117–134.
Tindell, K. 1992. Using offset information to analyse static priority pre-emptively scheduled task sets. Report YCS 182, Department of Computer Science, University of York.
Tindell, K. 1994. Analysis of hard real-time communications. Report YCS 222, Department of Computer Science, University of York.
Tindell, K., Burns, A., and Wellings, A. 1994. An extendible approach for analysing fixed priority hard real-time tasks.Real-Time Systems 6(2): 133–151.
Volz, Richard A., Sha, L., and Wilcox, D. 1991. Maintaining global time in futurebus+.Real Time Systems 3(1).
Vrchoticky, A., and Puschner, P. 1991. On the feasibility of response time predictions—An experimental evaluation. PDCS Project (Esprit BRA Project 3092), Second Year Report.
Zhao, W., and Ramamritham, K. 1986. A virtual time CSMA protocol for hard real time communication.Proceedings of the Real-Time Systems Symposium pp. 120–.
Znati, T., and Ni, L. M. 1987. A prioritized multiaccess protocol for distributed real-time applications.Proceedings 7th International Conference on Distributed Computing Systems pp. 324–331.
Author information
Authors and Affiliations
Additional information
This author can be contacted via e-mail as ken@rabat.docs.uu.se; copies of technical reports from York are available via FTP from minster.york.ac.uk in the directory /pub/realtime/papers
Rights and permissions
About this article
Cite this article
Tindell, K., Burns, A. & Wellings, A.J. Analysis of hard real-time communications. Real-Time Syst 9, 147–171 (1995). https://doi.org/10.1007/BF01088855
Issue Date:
DOI: https://doi.org/10.1007/BF01088855