Advertisement

Language-Independent Schedulability Analysis of Real-Time Programs

  • Alexander D. Stoyenko
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 167)

Abstract

The use of embedded real-time computing systems to control industrial, medical, scientific, consumer, environmental and other processes is rapidly growing. A failure of an embedded computing system to properly control its real-time process may lead to major losses, possibly including the loss of human life. A real-time application thus demands from its embedded computing system not only significant computation and control processing, but also, even more importantly, a guarantee of predictable, reliable and timely operation.

Keywords

Tight Frame Communication Unit Segment Tree Embed Computing System Simple Segment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

The Bibliography

  1. [1]
    “Advances in Power Station Construction”, Generating Development and Construction Division, Central Electricity Generating Board, Barnwood, Gloucester, UK, Pergamon Press, 1986, pp 313–328.Google Scholar
  2. [2]
    Theodore P. Baker, “A Corset for Ada”, TR 86-09-05, Computer Science Department, University of Washington, 1986.Google Scholar
  3. [3]
    Theodore P. Baker, “A Lace for Ada’s Corset”, TR 86-09-06, Computer Science Department, University of Washington, 1986.Google Scholar
  4. [4]
    Theodore P. Baker, “Implementing Timing Guarantees in Ada”, Proceedings of the Fourth IEEE Workshop on Real-Time Operating Systems, Cambridge, Massachusetts, July 1987, pp. 129–133.Google Scholar
  5. [5]
    Theodore P. Baker, “Improving Timing Predictability of Software”, Working Paper, Department of Computer Science, Florida State University, August 1987.Google Scholar
  6. [6]
    G. Chroust, “Orthogonal Extensions in Microprogrammed Multiprocessor Systems-A Chance for Increased Firmware Usage”, EUROMICRO Journal, 6,2, 104–110, 1980.CrossRefGoogle Scholar
  7. [7]
    James R. Cordy, Ric C. Holt, David B. Wortman, “S/SL Syntax/Semantic Language Introduction and Specification”, Technical Report CSRG-118, Computer Systems Research Group, University of Toronto, 1980.Google Scholar
  8. [8]
    James R. Cordy, Ric C. Holt, “Specification of Concurrent Euclid”, Technical Report CSRG-133, Computer Systems Research Group, University of Toronto, August 1981.Google Scholar
  9. [9]
    “DAIAPAC Standard Network Access Protocol Specifications”, Computer Communications Group, TCTS, Ottawa, 1976.Google Scholar
  10. [10]
    Edsgar W. Dijkstra, “Cooperating Sequential Processes”, Technical Report EWD-123, Technological University, Eindhoven, the Netherlands, 1965.Google Scholar
  11. [11]
    DIN 44300: Informationsverarbeitung, Nr. 161 (Realzeitbetrieb), March 1972.Google Scholar
  12. [12]
    DIN 66253: Programmiersprache Pearl, Teil 1 Basic Pearl, Vornorm, July 1981; Teil 2 FuU Pearl, Norm, October 1982.Google Scholar
  13. [13]
    M. R. Garey, D. S. Johnson, “Complexity Results for Multiprocessor Scheduling under Resource Constraints”, SIAM Journal on Computing, Vol. 4,No. 4, December 1975, pp. 397–411.MATHCrossRefGoogle Scholar
  14. [14]
    Wolfgang A. Halang, “On Methods for Direct Memory Access Without Cycle Stealing”. Microprocessing and Microprogramming, 17,5, May 1986.Google Scholar
  15. [15]
    Wolfgang A. Halang, “Implications on Suitable Multiprocessor Structures and Virtual Storage Management when Applying a Feasible Scheduling Algorithm”, Hard Real-Time Environments, Software-Practice and Experience, 16(8), 761–769, 1986.Google Scholar
  16. [16]
    Wolfgang A. Halang, Alexander D. Stoyenko, “Constructing Predictable Real-Time Systems”, to be printed by Kluwer Academic Publishers, Dordrecht-Hingham, 1991.Google Scholar
  17. [17]
    C. A. R. Hoare, “Monitors: An Operating System Structuring Concept”, Communications of the ACM, Vol. 17,No. 10, October 1974, pp. 549–557.MATHCrossRefGoogle Scholar
  18. [18]
    R. C. Holt, D. B. Wortman, X R. Cordy, D. R. Crowe, J. H. Griggs, “Euclid: A language for producing quality software,” Proceedings of the National Computer Conference, Chicago, May 1981.Google Scholar
  19. [19]
    Ric C. Holt, James R. Cordy, “The Turing Language Report”, Technical Report CSRG-153, Computer Systems Research Group, University of Toronto, December 1983.Google Scholar
  20. [20]
    Jean D. Ichbiah, “Reference Manual for the Ada Programming Language”, US. Department of Defense, 1980.Google Scholar
  21. [21]
    “KE-Handbuch”, Periphere Computer Systeme GmbH, Munich, 1981.Google Scholar
  22. [22]
    Eugene Kligerman, “A Programming Environment for Real-Time Systems”, M.Sc. Thesis, Department of Computer Science, University of Toronto, 1987.Google Scholar
  23. [23]
    Eugene Kligerman, Alexander D. Stoyenko, “Real-Time Euclid: A Language for Reliable Real-Time Systems,” IEEE Transactions on Software Engineering, Vol. SE-12,No. 9, pp. 940–949, September 1986.Google Scholar
  24. [24]
    R. Lauber, “Prozessautomatisierung I”, Berlin-Heidelberg-New York, Springer-Verlag, 1976.MATHGoogle Scholar
  25. [25]
    Dennis W. Leinbaugh, “Guaranteed Response Times in a Hard-Real-Time Environment,” IEEE Transactions on Software Engineering, Vol. SE-6,No. 1, January 1980, pp. 85–91.CrossRefGoogle Scholar
  26. [26]
    Dennis. W. Leinbaugh, Mohammed-Reza Yamini, “Guaranteed Response Times in a Distributed Hard-Real-Time Environment”, Proceedings of the IEEE 1982 Real-Time Systems Symposium, December 1982, pp. 157–169.Google Scholar
  27. [27]
    Dennis W. Leinbaugh, Mohammed-Reza Yamini, “Guaranteed Response Times in a Distributed Hard-Real-Time Environment,” IEEE Transactions on Software Engineering, Vol. SE-12,No. 12, pp. 1139–1144, December 1986.Google Scholar
  28. [28]
    John Y-T. Leung, M. L. Merrill, “A Note of Preemptive Scheduling of Periodic, Real-Time Tasks”, Information Processing Letters, Vol. 11,No. 3, pp. 115–118, November 1980.MATHCrossRefGoogle Scholar
  29. [29]
    John Y-T. Leung, J. Whitehead, “On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks”, Performance Evaluation, Vol. 2, pp. 237–250, 1982.CrossRefGoogle Scholar
  30. [30]
    C. L. Liu, W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment”, JACM, Vol. 20,No. 1, January 1973, pp. 46–61.MATHCrossRefGoogle Scholar
  31. [31]
    Aloysius K. Mok, “The Design of Real-Time Programming Systems Based on Process Models”, Proceedings of the IEEE 1984 Real-Time Systems Symposium, December 1984, pp. 5–17.Google Scholar
  32. [32]
    Aloysius K. Mok, Michael L. Dertouzos, “Multiprocessor Scheduling in a Hard-Real-Time Environment”, Proceedings of the 7th Texas Conference on Computing Systems, November 1978, pp. 5.1–5.12.Google Scholar
  33. [33]
    Chris Ngan, “Implementing the Real-Time Euclid Compiler”, Student Project Report, Department of Computer Science, University of Toronto, August 1986.Google Scholar
  34. [34]
    Gerry 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
  35. [35]
    Krithivasan Ramamritham, John A. Stankovic, “Dynamic Task Scheduling in Distributed Hard Real-Time Systems”, Proceedings of the IEEE 4th International Conference on Distributed Computing Systems, May 1984, pp. 96–107.Google Scholar
  36. [36]
    Krithivasan Ramamritham, John A. Stankovic, S. Cheng, “Evaluation of a Flexible Task Scheduling Algorithm for Distributed Hard Real-Time Systems”, IEEE Transactions on Computers, Vol. C-34,No. 12, December 1985, pp. 1130–1143.Google Scholar
  37. [37]
    A. M. Rybezynski and D. E Weir, “DATAPAC X.25 SERVICE CHARACTERISTICS”, Computer Communications Group, TCTS, Ottawa, 1977.Google Scholar
  38. [38]
    K. Schleisiek-Kern, “Private Communication”, DELTA t, Hamburg, 1990.Google Scholar
  39. [39]
    G. Schrott, “Ein Zuteilungsmodell für Multiprozessor-Echtzeitsysteme”, PhD Thesis, Technical University, Munich 1986.Google Scholar
  40. [40]
    L. Sha, J.B. Goodenough, “Real-Time Scheduling and Ada”, Technical Report CMU/SEI-89-TR-14, ESD-TR-89-22, Software Engineering Institute, Carnegie-Mellon University, 1989.Google Scholar
  41. [41]
    Series 32000 Instruction Set Reference Manual, National Semiconductor Corporation, Santa Clara, June 1984.Google Scholar
  42. [42]
    Connie U. Smith, “Independent General Principles for Constructing Responsive Software Systems”, ACM Transactions on Computer Systems, Vol. 4,No. 1, February 1986, pp. 1–31.CrossRefGoogle Scholar
  43. [43]
    Paul G. Sorenson, “A Methodology for Real-Time System Development”, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1974.Google Scholar
  44. [44]
    Paul G. Sorenson, V. Carl Hamacher, “A Real-Time System Design Methodology”, INFOR, Vol. 13,No. 1, February 1975, pp. 1–18.MATHGoogle Scholar
  45. [45]
    “Specifications for the IBM Mathematical FORmula TRANslating System, FORTRAN”, IBM Corporation, New York, November 10, 1954.Google Scholar
  46. [46]
    Alexander D. Stoyenko, “Turing goes real-time…”, Interna Programming Languages Report, Department of Computer Science, University of Toronto, May 1984.Google Scholar
  47. [47]
    Alexander D. Stoyenko, “Real-Time Systems: Scheduling and Structure”, M.Sc. Thesis, Department of Computer Science, University of Toronto, 1984.Google Scholar
  48. [48]
    Alexander D. Stoyenko, “A Real-Time Language with A Schedulability Analyzer”, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1987.Google Scholar
  49. [49]
    Alexander 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
  50. [50]
    ***not quoted in text*** Alexander D. Stoyenko, “A Case for Schedulability Analyzable Real-Time Languages,” Proceedings of the IEEE 1987 Workshop on Real-Time Operating Systems, April 1987, Cambridge, Massachusetts.Google Scholar
  51. [51]
    Alexander D. Stoyenko, “Real-Time Euclid: Concepts Useful for the Further Development of PEARL,” Keynote Speech, Proceedings of PEARL’90, November-December 1990, Boppard, Germany.Google Scholar
  52. [52]
    Alexander D. Stoyenko, Wolfgang A. Halang, “Analysing PEARL Programs for Timely Executability and Schedulability” (“Analyse zeitgerechter Zuteilbarkeit und Ausf\”uhrbarkeit von PEARL-Programmen”), Proceedings of the Fachtagung ProzeBrechensysterne’91 Conference, February 1991, Berlin, Germany.Google Scholar
  53. [53]
    T. J. Teixeira, “Static Priority Interrupt Scheduling”, Proceedings of the 7th Texas Conference on Computing Systems, November 1978, pp. 5.13–5.18.Google Scholar
  54. [54]
    T. Tempelmeier, “A Supplementary Processor for Operating System Functions”, 1979 IFAC/IFIP Workshop on Real-Time Programming, Smolenice, 18–20 June 1979.Google Scholar
  55. [55]
    T. Tempelmeier, “Operating System Processors in Real-Time Systems-Performance Analysis and Measurement”, Computer Performance, Vol. 5,No. 2, 121–127, June 1984.Google Scholar
  56. [56]
    Scott 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
  57. [57]
    Jeffrey D. Ullman, “Polynomial complete scheduling problems”, Proceedings of the 4th Symposium on OS Principles, 1973, pp. 96–101.Google Scholar
  58. [58]
    Niklaus Wirth, “The Programming Language Pascal,” Acta Informatical, pp. 35–63, 1971.Google Scholar
  59. [59]
    Wei Zhao, Krithivasan Ramamritham, “Distributed Scheduling Using Bidding and Focused Addressing”, Proceedings of the IEEE 1985 Real-Time Systems Symposium, December 1985, pp. 103–111.Google Scholar

Copyright information

© Kluwer Academic Publishers 1992

Authors and Affiliations

  • Alexander D. Stoyenko
    • 1
  1. 1.Department of Computer and Information ScienceNew Jersey Institute of TechnologyNewarkUSA

Personalised recommendations