Skip to main content
Springer Nature Link
Log in

A model for scheduling of object-based, distributed real-time systems

  • Published:
Real-Time Systems Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper describes a general model for pre-run-time scheduling of distributed real-time systems that are composed of abstract data types (definable in languages such as Ada, Clu and Modula-2) and abstract data objects (which can be defined in C++, Eiffel and RT Euclid). An architecture model, a programming paradigm, and execution and communication paradigms form the basis for this general model. The model includesabsolute timing constraints to represent periodicity and deadlines,relative timing constraints to model several kinds of timed precedence relations and synchronization requirements,independency constraints to capture non-determinism of conditionals and repetitions, andconsistency constraints to enforce consistent use of resources. In this paper, the model is formalized to obtain a mathematical foundation on which assignment (Verhoosel et al. 1993a, Welch 1992, Welch et al. 1993) and pre-run-time scheduling problems (Verhoosel et al. 1991, Verhoosel 1992, 1993a, 1993c) are defined. Additionally, the model is extended to allow exploitation of parallelism from programs, a technique that can be used during assignment and scheduling for meeting timing constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blazewicz, J., Drabowski, M., and Weglarz, J. 1986. Scheduling multiprocessor tasks to minimize schedule length.IEEE Transactions on Computers 35(5): 389–393.

    Google Scholar 

  2. v. Dijk, G. J. W. 1993. The design of the EMPS multiprocessor executive for distributed computing system. Ph.D. Thesis, Eindhoven University of Technology.

  3. Fohler, G., and Koza, C. 1989. Heuristic scheduling for distributed real-time systems. Technical Report Nr 6/89, University of Technology Vienna.

  4. Garey, M. R., and Johnson, D. S. 1977. Two-processor scheduling with starttimes and deadlines.SIAM Journal on Computing 6: 416–426.

    Google Scholar 

  5. Garey, M. R., and Johnson, D. S. 1979. Computers and intractability, A guide to the theory of NP-completeness. New York: Freeman.

    Google Scholar 

  6. Hammer, D. K. 1993. Object-oriented modelling of real-time systems: What are the important issues for the future.First Workshop on Parallel and Distributed Real-Time Systems, Newport Beach, April.

  7. Hammer, D. K. 1992. Synchronization techniques, illustrated by the concepts of the dependable distributed operating system DEDOS.Proceedings of the NATO Advanced Study Institute on Real-Time Computing, Sint Maarten, October.

  8. Hammer, D. K., and van Roosmalen, O. S. 1992. An object-oriented model for the construction of dependable distributed systems.International Workshop on Object-Orientation in Operating Systems (I-WOOOS 92), Paris, France, September.

  9. Henn, R. 1975. Deterministische Modelle für die Prozessorzuteilung in einer harten Realzeit-Umgebung. Ph.D. Thesis, Technical University Munich.

  10. Kligerman, E., and Stoyenko, A. D. 1986. Real-time Euclid: A language for reliable real-time systems.IEEE Transactions on Software Engineering SE-12(9): 940–949.

    Google Scholar 

  11. Kopetz, H., Damm, A., Koza, C., Mulazzani, M., Schwabl, W., Senft, C., and Zainlinger, R. 1989. Distributed fault-tolerant real-time systems: The MARS approach.IEEE Micro.

  12. Leinbaugh, D. 1980. Guaranteed response times in a hard real-time environment.IEEE Transactions on Software Engineering SE-6: 85–91.

    Google Scholar 

  13. Leinbaugh, D., and and Yamini, M.-R. 1982. Guaranteed response times in a distributed hard real-time environment.Proceedings IEEE Real-Time Systems Symposium, pp. 157–169.

  14. Leinbaugh, D., and and Yamini, M.-R. 1986. Guaranteed response times in a distributed hard real-time environment.IEEE Transactions on Software Engineering SE-12: 1139–1144.

    Google Scholar 

  15. Liu, C., and Layland, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment.Journal of the ACM 20: 46–61.

    Google Scholar 

  16. Mok, A. 1984. The design of real-time programming systems based on process models.Proceedings IEEE Real-Time Systems Symposium, pp. 5–17.

  17. Mok, A., and Dertouzos, M. 1978. Multiprocessor scheduling in a hard real-time environment.Proceedings of the 7th Texas Conference on Computing Systems, pp. 5.1–5.12.

  18. Peng, D., and Shin, K. G. 1987. Modeling of concurrent task execution in a distributed system for real-time control.IEEE Transaction on Computers 36(4): 500–516.

    Google Scholar 

  19. Ramamritham, K. 1990. Allocation and scheduling of complex periodic tasks.10th International Conference on Distributed Computing Systems, pp. 108–115.

  20. Ramamritham, K., and Stankovic, J. 1984. Dynamic task scheduling in distributed hard real-time systems.Proceedings of the 4th IEEE International Conference on Distributed Computing Systems, pp. 96–107.

  21. Sha, L., Rajkumar, R., and Lehoczky, J. 1987. Priority inheritance protocols: An approach to real-time synchronization. Technical Report CMU-CS-87-181, Carnegie-Mellon University, November 1987.

  22. Sih, G. C., and Lee, E. A. 1993. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures.IEEE Transactions on Parallel and Distributed Systems 4(2), February.

  23. Sitaraman, M., Welch, L. R., and Harms, D. E. 1993. On specification of reusable software components.The International Journal of Software Engineering and Knowledge Engineering 3(2).

  24. Sorenson, P. 1974. A methodology for real-time system development. Ph.D. Thesis, University of Toronto, Department of Computer Science.

  25. Sorenson, P., and Hamacher, V. 1975. A real-time system design methodology.INFOR 13: 1–18, February.

    Google Scholar 

  26. Stankovic, J., 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.

    Google Scholar 

  27. v. d. Stok, P. D. V., v.Roosmalen, O. S., Luit, E. J., and Hammer, D. K. 1991. The dependable distributed operating system DEDOS. Internal Report, Department of Mathematics and Computing Science, Eindhoven University of Technology, August.

  28. v. d. Stok, P. D. V., v.d. Berk, F., Deckers, R., v.d. Vijver, V., Botman, J. I. M., and Timmermans, C. J. 1993. Object-oriented design for accelerator control.RT93, May, Vancouver.

  29. Stoyenko, A. D., and Welch, L. R. 1994. Response time prediction in object-based, parallel embedded systems.Euromicro Journal, Special Issue on Parallel Processing in Embedded Real-Time Systems, to appear.

  30. Stoyenko, A. 1984. Real-time systems: Scheduling and stucture. Master's Thesis, Department of Computer Science, University of Toronto.

  31. Stoyenko, A. D. 1987. A schedulability analyzer for real-time Euclid.Proceedings of the IEEE Real-Time Systems Symposium, pp. 218–227, San Jose, December.

  32. Stoyenko, A. D., Hamacher, V. C., and Holt, R. C. 1991. Analyzing hard-real-time programs for guaranteed schedulability.IEEE Transactions on Software Engineering SE-17(8): 737–750.

    Google Scholar 

  33. Stoyenko, A. D., and Marlowe, T. J. 1992. Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention.Journal of Real-Time Systems 4(4).

  34. Stoyenko, A. D., Marlowe, T. J., Halang, W. A., and Younis, M. 1993. Enabling efficient schedulability analysis through conditional linking and program transformations.Control Engineering Practice 1(1).

  35. Stoyenko, A. D., Welch, L. R., Marlowe, T. J., Cheng, B. C., and Ganesh, A. K. 1994. Performance prediction functions for real-time software components.IEEE Transactions on Software Engineering (submitted for publication).

  36. Teixeira, T. 1978. Static priority interrupt scheduling.Proceedings of the 7th Texas Conference on Computing Systems, pp. 5.13–5.18, November.

  37. Verhoosel, J. P. C. 1992. Off-line scheduling of hard real-time distributed systems using Windows (Extended Abstract).Proceedings of the NATO ASI Workshop on Real-Time Computing, St. Maarten, October.

  38. Verhoosel, J. P. C. 1993a. Deterministic scheduling of distributed hard real-time systems using Windows.Proceedings of the First IEEE Workshop on Parallel and Distributed Real-Time Systems, Newport Beach, April.

  39. Verhoosel, J. P. C. 1993b. A formal deterministic scheduling model for hard real-time executions in DEDOS. Computing Science Note 93/08, Department of Mathematics and Computing Science, Eindhoven University of Technology, April.

  40. Verhoosel, J. P. C. 1993c. Local scheduling for distributed hard real-time systems using Windows. To be published as a Computing Science Note, Department of Mathematics and Computing Science, Eindhoven University of Technology.

  41. Verhoosel, J. P. C., Luit, E. J., Hammer, D. K., and Jansen, E. 1991. A static scheduling algorithm for distributed hard real-time systems.The Journal of Real-Time Systems, pp. 227–246.

  42. Verhoosel, J. P. C., Welch, L. R., Hammer, D. K., and Stoyenko, A. D. 1994. Assignment and pre-run-time scheduling of object-oriented, hard real-time parallel processes using bead partitioning. Computing Science Note CIS-93-16, New Jersey Institute of Technology, November 1993, Submitted to IPPS'94.

  43. Verhoosel, J. P. C., Welch, L. R., Hammer, D. K., and Stoyenko, A. D. 1993. A model for assignment and pre-run-time scheduling of object-based, distributed real-time systems. Computing Science Note CIS-93-17, New Jersey Institute of Technology, November.

  44. Welch, L. R. 1992. Assignment of ADT modules to processors.Proceedings of the International Parallel Processing Symposium, March.

  45. Welch, L. R. 1993. Cloning ADT modules to increase parallelism: Rationale and techniques.Fifth IEEE Symposium on Parallel and Distributed Computing, December.

  46. Welch, L. R. To appear. A parallel virtual machine for programs composed of abstract data types.IEEE Transactions on Computers, accepted for publication.

  47. Welch, L. R., Stoyenko, A. D., and Marlowe, T. J. 1992. Modeling resource contention among distributed periodic processes.Fourth IEEE Symposium on Parallel and Distributed Computing, December.

  48. Welch, L. R., Stoyenko, A. D., and Chen, S. 1993. Assignment of ADT modules with random neural networks.The Hawaii International Conference on System Sciences, IEEE, January.

  49. Xu, J. 1993. Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations.IEEE Transactions on Software Engineering 19(2), February.

  50. Xu, J., and Parnas, D. L. 1990. Scheduling processes with release times, deadlines, precedence, and exclusion relations.IEEE Transactions on Software Engineering 16(3), March.

  51. Xu, J., and Parnas, D. L. 1993. On satisfying timing constraints in hard-real-time systems.IEEE Transaction on Software Engineering 19(1), January.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB, Eindhoven, The Netherlands

    Jack P. C. Verhoosel, Dieter K. Hammer & Erik Y. Luit

  2. Real-Time Computing Laboratory, Department of Computer and Information Science, New Jersey Institute of Technology, 07102, Newark, NJ, USA

    Lonnie R. Welch & Alexander D. Stoyenko

Authors
  1. Jack P. C. Verhoosel
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Dieter K. Hammer
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Erik Y. Luit
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Lonnie R. Welch
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Alexander D. Stoyenko
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Verhoosel, J.P.C., Hammer, D.K., Luit, E.Y. et al. A model for scheduling of object-based, distributed real-time systems. Real-Time Syst 8, 5–34 (1995). https://doi.org/10.1007/BF01893144

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01893144

Keywords