Skip to main content
SpringerLink
Log in

Predictability and Techniques for Schedulability Analysis

  • Conference paper
Real Time Computing

Part of the book series: NATO ASI Series ((NATO ASI F,volume 127))

  • 218 Accesses

Abstract

A typical real-time application involves the use and control of expensive equipment, possibly in situations where a missed deadline may well lead to substantial damage, including loss of human life. For many real-time systems it is thus of paramount importance that they adhere predictably to their critical timing constraints. A real-time system must be tested, analysed and checked to adhere to its critical timing constraints before the system is put in place.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T.P. Baker and G.L. Scallon, An Architecture for Real-time Software Systems, IEEE Software, May 1986, 50–59; reprinted in tutorial “Hard Real-Time Systems”, IEEE Press, 1988.

    Google Scholar 

  2. G. Chroust, Orthogonal Extensions in Microprogrammed Multiprocessor Systems — A Chance for Increased Firmware Usage, EUROMICRO Journal, Vol. 6, No. 2, 1980, 104–110.

    Google Scholar 

  3. K. Ecker, Organisation von parallelen Prozessen, Bibliographisches Institut, Mannheim, Germany, 1977.

    Google Scholar 

  4. J. Ferrante, K. Ottenstein, J. D. Warren, The Program Dependence Graph and its Use in Optimization, ACM Transactions on Programming Languages and Systems, Vol. 9, No. 3, 319–349.

    Google Scholar 

  5. M. R. Carey, D. S. Johnson, Complexity Results for Multiprocessor Scheduling under Resource Constraints, SIAM Journal on Computing, Vol. 4, No. 4, December 1975, 397–411.

    Article  MathSciNet  Google Scholar 

  6. W. A. Halang, On Methods for Direct Memory Access Without Cycle Stealing. Microprocessing and Microprogramming, 17, 5, May 1986.

    Google Scholar 

  7. W. A. Halang, Implications on Suitable Multiprocessor Structures and Virtual Storage Management when Applying a Feasible Scheduling Algorithm, in “Hard Real-Time Environments, Software — Practice and Experience, Vol. 16, No. 8, 1986, 761–769.

    Google Scholar 

  8. W. A. Halang, A. D. Stoyenko, Constructing Predictable Real-Time Systems, Kluwer Academic Publishers, Dordrecht-Hingham, 1991.

    Book  MATH  Google Scholar 

  9. M. Harmon, T. Baker and D. Whalley, A Retargetable Technique for Predicting Execution Time, Proceedings of the IEEE Real-Time Systems Symposium, IEEE, December 1992.

    Google Scholar 

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

    Google Scholar 

  11. C. A. R. Hoare, An Axiomatic Basis for Computer Programming, Communications of the ACM, Vol. 10, No. 12, 1969.

    Google Scholar 

  12. J. Hooman, W.-P. de Roever, Design and Verification in Real-Time Distributed Computing and Introduction to Compositional Methods, Proceedings of the Ninth International Symposium on Protocol Specification, Testing, and Verification, North-Holland, 1989.

    Google Scholar 

  13. J. Hooman, Specification and Compositional Verification of Real-Time Systems, Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, the Netherlands, 1991.

    Google Scholar 

  14. S. Horwitz, J. Prins, T. Reps, Integrating Non-Interfering Versions of Programs,Conference Record of the Fifteenth Annual ACM Conference on the Principles of Programming Languages, 133–145.

    Google Scholar 

  15. E. Kligerman, A. D. Stoyenko, Real-Time Euclid: A Language for Reliable Real-Time Systems, IEEE Transactions on Software Engineering, Vol. SE-12, No. 9, September 1986, 940–949.

    Google Scholar 

  16. D. W. Leinbaugh, Guaranteed Response Times in a Hard-Real-Time Environment, IEEE Transactions on Software Engineering, Vol. SE-6, No. 1, January 1980, 85–91.

    Google Scholar 

  17. D. W. Leinbaugh, M.-R. Yamini, Guaranteed Response Times in a Distributed Hard-Real-Time Environment, Proceedings of the IEEE 1982 Real-Time Systems Symposium, December 1982, 157–169.

    Google Scholar 

  18. D. W. Leinbaugh, M.-R. Yamini, Guaranteed Response Times in a Distributed Hard-Real-Time Environment, IEEE Transactions on Software Engineering, Vol. SE-12, No. 12, December 1986, 1139–1144.

    Article  Google Scholar 

  19. C. L. Liu, J. W. Layland, Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, JACM, Vol. 20, No. 1, January 1973, 46–61.

    MATH  Google Scholar 

  20. T. J. Marlowe, S. P. Masticola, Safe Optimization of Hard-Real-Time Programs, Proceedings of the Second International Conference on Systems Integration, June 1992.

    Google Scholar 

  21. T. J. Marlowe, B. G. Ryder, Properties of Data-Flow Frameworks: A Unified Model, Acta Informatica, Vol. 28, No. 2, 1991, 121–164.

    Article  MathSciNet  Google Scholar 

  22. V. Nirkhe, W. Pugh, Application of Partial Evaluation to Hard Real-Time Programming,Proceedings of the IEEE/IFAC 1991 Workshop on Real-Time Operating Systems and Software, 74–79.

    Google Scholar 

  23. V. Nirkhe, W. Pugh, Partial Evaluation of High-level Imperative Languages, with Applications in Hard Real-Time Systems,Conference Record of the Nineteenth Annual ACM Conference on the Principles of Programming Languages, 269–280.

    Google Scholar 

  24. J. S. Ostroff, Survey of Formal Methods for the Specification and Design of Real-Time Systems, Tutorial on the Specification of Time, IEEE Press, 1993

    Google Scholar 

  25. D. Padua, M. J. Wolfe, Advanced Compiler Optimizations for Supercomputers, Communications of the ACM, Vol. 22, No. 12, 1986, 1184–1201.

    Article  Google Scholar 

  26. G. Parnis, Simulation of Packet Level Handshaking in X.25 Using the Real-Time Euclid Programming Language, Student Project Report, Department of Computer Science, University of Toronto, April 1987.

    Google Scholar 

  27. KE-Handbuch,Periphere Computer Systeme GmbH, Munich, 1981.

    Google Scholar 

  28. E. Schatz, B. G. Ryder, Directed Tracing to Detect Race Conditions, Rutgers University Laboratory for Computer Science Research Technical Report No. LCSR-TR-176, 1990. ( To appear, Proceedings of the 1992 International Conference on Parallel Processing).

    Google Scholar 

  29. K. Schleisiek-Kern, Private Communication, DELTA t, Hamburg, 1990.

    Google Scholar 

  30. G. Schrott, Ein Zuteilungsmodell fuer Multiprozessor-Echtzeitsysteme, Ph.D. Thesis, Technical University, Munich 1986.

    Google Scholar 

  31. P. G. Sorenson, A Methodology for Real-Time System Development, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1974.

    Google Scholar 

  32. A. D. Stoyenko, Turing goes Real-Time…, Internal Programming Languages Report, Department of Computer Science, University of Toronto, May 1984.

    Google Scholar 

  33. A. D. Stoyenko, A Schedulability Analyzer for Real-Time Euclid, Proceedings of the IEEE 1987 Real-Time Systems Symposium, pp. 218–225, December 1987.

    Google Scholar 

  34. A. D. Stoyenko, A Real-Time Language with A Schedulability Analyzer, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1987.

    Google Scholar 

  35. A. D. Stoyenko, W. A. Halang, High-Integrity PEARL: A Language for Industrial Real-Time Applications, to appear in: IEEE Software in 1993; a Longer version available as “High-Integrity PEARL and its Schedulability Analyzer: Transferring State-of-the-Art Real-Time Software Technology from University Laboratories to Industry,” Department of Computer and Information Science Technical Report Cis-91–16, New Jersey Institute of Technology, July 1991.

    Google Scholar 

  36. A. D. Stoyenko, V. C. Hamacher, R. C. Holt, Schedulability Analysis of HardReal-Time Programs, IEEE Transactions on Software Engineering, Vol. 17, No. 8, August 1991.

    Google Scholar 

  37. A. D. Stoyenko, T. J. Marlowe, Schedulability, Program Transformations and Real-Time Programming, Joint IEEE and IFAC/IFIP Workshop on Real-Time Systems, Atlanta, Georgia, USA, May 1991, 33–41, also in Real Time Programming, Pergamon Press, 1992, 33–41.

    Google Scholar 

  38. A. D. Stoyenko, T. J. Marlowe, Polynomial-Time Transformations and Schedulability Analysis of Parallel Real-Time Programs with Restricted Resource Contention, Real-Time Systems Vol. 4, No. 4, November 1992, 307–329.

    Article  Google Scholar 

  39. A. D. Stoyenko, T. J. Marlowe, W. A. Halang, M. Younis, Enabling Efficient Schedulability Analysis through Conditional Linking and Program Transformations, Control Engineering Practice, Vol. 1, No. 1, January 1993.

    Google Scholar 

  40. A. D. Stoyenko, L. R. Welch, Analysis of Timing Behavior of Software Components in Complex Systems, in revision for IEEE Software, 1993.

    Google Scholar 

  41. A. D. Stoyenko, L. R. Welch, Metrics for Assigning Components of Complex Real-Time Systems, a working paper, 1993.

    Google Scholar 

  42. R. Strom, D. M. Yellin, Extending Typestate Checking Using Conditional Liveness Analysis,IEEE Transactions on Software Engineering, to appear.

    Google Scholar 

  43. T. Tempelmeier, A Supplementary Processor for Operating System Functions, 1979 IFAC/IFIP Workshop on Real-Time Programming, Smolenice, 18–20 June 1979.

    Google Scholar 

  44. T. Tempelmeier, Operating System Processors in Real-Time Systems — Performance Analysis and Measurement, Computer Performance, Vol. 5, No. 2, June 1984, 121–127.

    Google Scholar 

  45. S. A. Thurlow, Simulation of a Real Time Control System Using the Real-Time Euclid Programming Language, Student Project Report, Department of Computer Science, University of Toronto, April 1987.

    Google Scholar 

  46. J. D. Ullman, Polynomial complete scheduling problems, Proceedings of the 4th Symposium on OS Principles, 1973, 96–101.

    Google Scholar 

  47. M. Weiser, Program Slicing, IEEE Transactions on Software Engineering, Vol. sE-10, No. 4, 1984, 352–357.

    Google Scholar 

  48. M. J. Wolfe, U. Banerjee, Data Dependence and its Application to Parallel Processing, International Journal of Parallel Processing, Vol. 16, No. 2, 1987, 137–178.

    Article  MathSciNet  MATH  Google Scholar 

  49. M. J. Wolfe, Supercompilers for Supercomputers, The MIT Press, Cambridge MA, 1989.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Alexander D. Stoyenko

  2. Dept. of Mathematics and Computer Science, Seton Hall University, South Orange, NJ, 07079, 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

Editor information

Editors and Affiliations

  1. Vakgroep Informatica, Rijksuniversiteit Groningen, Postbus 800, 9700 AV, Groningen, The Netherlands

    Wolfgang A. Halang

  2. Fachbereich Elektrotechnik und Informationstechnik, FernUniversität Hagen, D-58084, Hagen, Germany

    Wolfgang A. Halang

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

    Alexander D. Stoyenko

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stoyenko, A.D., Marlowe, T.J. (1994). Predictability and Techniques for Schedulability Analysis. In: Halang, W.A., Stoyenko, A.D. (eds) Real Time Computing. NATO ASI Series, vol 127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-88049-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-88049-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-88051-3

  • Online ISBN: 978-3-642-88049-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation