Skip to main content
SpringerLink
Log in

Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention

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

Abstract

We present polynomial-time static semantics-preserving transformations of real-time programs. Used in conjunction with schedulability analysis, the transformations significantly increase the class of real-time programs that may be analyzed efficiently for guaranteed schedulability at compile-time. In cases where the form of resource contention among processes resists efficient transformation, we apply a heuristic transformation (and a consequent run-time scheduling heuristic) to allow the programs to be analyzed efficiently.

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

Access this article

Log in via an institution

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. Aho, A.V., Sethi, R., Ullman, J.D. 1986. Compilers: Principles, Techniques, Tools, Reading, MA: Addison-Wesley.

    Google Scholar 

  2. Allen, F.E., Rosen, B., Zadeck, F.K. 1991. Compilers, Optimization, ACM Press/Addison-Wesley, (to appear).

  3. Deransart, P., Jourdan, M., and Lorho, B. 1988. Attribute Grammars: Definitions, Systems, Bibliograph, No. 323, Berlin/New York: Springer-Verlag, Lecture Notes in Computer Science, May 1988.

    Google Scholar 

  4. Haase, V.H. 1981. Real time behavior of programs. IEEE Transactions on Software Engineering, SE-5(7): 494–501.

    Google Scholar 

  5. Halang, W.D. 1984. A proposal for extensions of PEARL to facilitate formulation of hard real-time applications. Informatik-Fachberichte 86, Berlin/New York: Springer-Verlag, pp. 573–582.

    Google Scholar 

  6. Hecht, M. 1977. Flow Analysis of Computer Programs. Elsevier Sequoia S.A., Lausanne, Amsterdam, the Netherlands.

    Google Scholar 

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

    Google Scholar 

  8. Knuth, D. 1968, 1971. Semantics of context-free languages. Mathematical Systems Theory, 2(2): 127–145; Correction, 1971, 5(1): 95–96.

    Google Scholar 

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

    Google Scholar 

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

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

    Google Scholar 

  12. Mok, A.K., Amerasinghe, P., Chen, M., and Tantisirivat, K. 1989. Evaluating tight execution time bounds of programs by annotations. IEEE Workshop on Real-Time Operating Systems and Software, Pittsburgh, PA, May, pp. 74–80.

  13. Nirkhe, V., and Pugh, W. 1991. Application of partial evaluation to hard real-time programming. IEEE Workshop on Real-Time Operating Systems and Software, Atlanta, GA, May, pp. 74–79.

  14. Park, C., and Shaw, A.C. 1990. Experiments with a program timing tool based on a source-level timing schema. IEEE Real-Time Systems Symposium, Orlando, FL, December.

  15. Puschner, P., and Koza, Ch. 1989. Calculating the maximum execution time of real-time programs. International Journal of Time-Critical Computing Systems, 1(2): 159–176.

    Google Scholar 

  16. Shaw, A.C. 1990. Deterministic Timing Schemata for Parallel Programs. University of Washington, Department of Computer Science and Engineering, 89-05-06, May.

  17. Shaw, M. 1979. A Formal System for Specifying, Verifying Program Performance. Carnegie-Mellon University, Computer Science Department, CMU-CS-79-129, June.

  18. Shaw, A.C. 1989. Reasoning about time in higher-level language software. IEEE Transactions on Software Engineering, SE-15(7): 875–889.

    Google Scholar 

  19. Stoyenko, A.D., 1987. A schedulability analyzer for real-time Euclid. IEEE Real-Time Systems Symposium, San Jose, CA, December, pp. 218–225.

  20. Stoyenko, A.D. 1987b. A real-time language with a schedulability analyzer. University of Toronto, Department of Computer Science, Technical Report CSRI-206, December.

  21. Stoyenko, A.D., Hamacher, V.C., and Holt R.C. 1991. Analyzing hard-real-time programs for guaranteed schedulability. IEEE Transactions on Software Engineering, 8, August, vol. 17, no. 8, pp. 737–750.

  22. Wedde, H.F., Korel, B., and Huizinga, D.M. Static analysis of timing properties for distributed real-time programs. IEEE Workshop on Real-Time Operating Systems and Software, Atlanta, GA, May, pp. 88–95.

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, New Jersey Institute of Technology, 07102, Newark, New Jersey, USA

    Alexander D. Stoyenko

  2. Department of Mathematics and Computer Science, Seton Hall University, 07079, South Orange, New Jersey, USA

    Thomas J. Marlowe

Authors
  1. Alexander D. Stoyenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas J. Marlowe
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work is supported in part by the U.S. Office of Naval Research Grant N00014-92-J-1367 and AT&T UEDP grant 91-134. Work on this paper was completed, and the paper submitted while this author was visiting Department of Computer Science, University of Twente, Enschede, The Netherlands, under the conditions of the NATO Collaborative Research Grant CRG-901007.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stoyenko, A.D., Marlowe, T.J. Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention. Real-Time Syst 4, 307–329 (1992). https://doi.org/10.1007/BF00355297

Download citation

  • Issue Date:

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

Keywords

Search

Navigation