Skip to main content
SpringerLink
Log in

Analysing PEARL Programs for Timely Schedulability and Executability

(Analyse zeitgerechter Zuteilbarkeit und Ausführbarkeit von PEARL-Programmen)

  • Conference paper
Prozeßrechensysteme ’91

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 269))

Abstract

PEARL is a widely-used, standardised, industrial process-control programming language. The programs, that are written in PEARL, are typically expected to operate in a predictable, timely, reliable manner. Developing such programs is no easy task. Yet, with the invent of the experimental programming language Real-Time Euclid and its schedulability analyser, a tool that is used to predict whether real-time software will adhere to its critical timing constraints, it has been demonstrated that this task may be made considerably easier.

In this paper, we describe how PEARL can be modified to be better suitable for realtime application writing, and to accommodate schedulability analysis. We propose a design for a schedulability analyser for PEARL. We feel confident that the analyser can be applied successfully to PEARL programs, thus aiding greatly in the process of developing predictable, timely and reliable software.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. DIN 44 300 A2, Informationsverarbeitung. Berlin: Beuth-Verlag 1985.

    Google Scholar 

  2. C. D. Williams, “The Data Acquisition, Data Reduction and Control System (DARCS) for the NRCC 2×3m Windtunnel,” Proceeding of the IEEE 1984 Real-Time Systems Symposium, December 1984, pp. 89–94.

    Google Scholar 

  3. P. W. Kelton, “Distributed Computing for Astronomical Data Acquisition at McDonald Observatory,” Proceeding of the IEEE 1984 Real-Time Systems Symposium, December 1984, pp. 83–88.

    Google Scholar 

  4. G. Kaplan, “The X-29: Is it coming or going?,” IEEE Spectrum, June 1985, pp. 54–60.

    Google Scholar 

  5. G. D. Carlow, “Architecture of the Space Shuttle Primary Avionics Software System,” Communications of the ACM, Vol. 27, No. 9, September 1984, pp. 926–936.

    Article  Google Scholar 

  6. B. M. Aucoin, R. P. Heller, “Overcurrent and High Impedance Fault Relaying using a Microcomputer,” Proceedings of the 7th Texas Conference on Computing Systems, November 1978, pp. 2.5–2.9.

    Google Scholar 

  7. E. T. Fathi, N. R. Fines, “Real-Time Data Acquisition, Processing and Distribution for Radar Applications,” Proceeding of the IEEE 1984 Real-Time Systems Symposium, December 1984, pp. 95–101.

    Google Scholar 

  8. V. P. Nelson, H. L. Fellows Jr., “A Microcomputer-Based Controller for an Amusement Park Ride,” IEEE Micro, August 1981, pp. 13–22.

    Google Scholar 

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

    Google Scholar 

  10. A. D. Stoyenko, A Real-Time Language with A Schedulability Analyzer, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1987, available as Computer Systems Research Institute Technical Report CSRI-206.

    Google Scholar 

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

    Google Scholar 

  12. N. Wirth, “The Programming Language Pascal,” Acta Informatica 1, 1971, pp. 35–63. 15

    Article  MATH  Google Scholar 

  13. R. C. Holt et al., “Euclid: A language for producing quality software,” Proceedings of the National Computer Conference, Chicago, May 1981.

    Google Scholar 

  14. J. R. Cordy, R. C. Holt, Specification of Concurrent Euclid, Technical Report CSRG-133, Computer Systems Research Group, University of Toronto, August 1981.

    Google Scholar 

  15. DIN 66 253, Programming Language PEARL (Programmiersprache PEARL), Teil 1 Basic PEARL, 1981; Teil 2 Full PEARL, 1982. Berlin: BeuthVerlag.

    Google Scholar 

  16. W. A. Halang, “On Real-Time Features Available in High-Level Languages and Yet to be Implemented,” Microprocessing and Microprogramming, Vol. 12, 1983, pp. 79–87.

    Article  Google Scholar 

  17. W. A. Halang, A. D. Stoyenko, “Comparitative Evaluation of High Level Real Time Programming Languages,” Real-Time Systems, Vol. 2, No. 4, 1990.

    Google Scholar 

  18. A. D. Stoyenko, The State of the Art in Hard-Real-Time Modeling and Languages, Ph.D. Qualifying Paper, Department of Computer Science, University of Toronto, May 1986.

    Google Scholar 

  19. G. Berry, S. Moisan, J.-P. Rigault, “Esterel: Towards a Synchronous and Semantically Sound High Level Language for Real-Time Applications,” Proceedings of the IEEE 1983 Real- Time Systems Symposium, December 1983, pp. 30–37.

    Google Scholar 

  20. W. A. Halang, “A Proposal for Extensions of PEARL to Facilitate the Formulation of Hard Real-Time Applications,” Informatik- Fachberichte 86, pp. 573–582, Berlin-Heidelberg-New York-Tokyo: Springer-Verlag 1984.

    Google Scholar 

  21. W. A. Halang, R. Henn, “Additional PEARL Language Structures for the Implementation of Reliable and Inherently Safe Real-Time Systems,” Proceedings of the 15th IFAC/IFIP Workshop on Real Time Programming, Oxford: Pergamon Press 1988, pp. 35–42.

    Google Scholar 

  22. W. Ehrenberger, “Softwarezuverlassigkeit und Programmiersprache,” PEARL-Rundschau, Vol. 3, No. 2, 1982, pp. 49–55.

    Google Scholar 

  23. Series 3200 Instruction Set Reference Manual, National Semiconductor Corporation, Santa Clara, June 1984.

    Google Scholar 

  24. D. 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.

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  27. A. 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 

  28. A. K. Mok, M. 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 

  29. K. Ramamritham, J. 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 

  30. K. Ramamritham, J. 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 

  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. P. G. Sorenson, V. C. Hamacher, “A Real-Time System Design Methodology”, INFOR, Vol. 13, No. 1, February 1975, pp. 1–18.

    MATH  MathSciNet  Google Scholar 

  33. A. D. Stoyenko, Real-Time Systems: Scheduling and Structure, M.Sc. Thesis, Department of Computer Science, University of Toronto, 1984.

    Google Scholar 

  34. 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 

  35. W. Zhao, K. Ramamritham, “Distributed Scheduling Using Bidding and Focused Addressing”, Proceeding of the IEEE 1985 Real-Time Systems Symposium, December 1985, pp. 103–111.

    Google Scholar 

  36. 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.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  38. E. Kligerman, A Programming Environment for Real-Time Systems, M.Sc. Thesis, Department of Computer Science, University of Toronto, 1987.

    Google Scholar 

  39. C. Ngan, Implementing the Real-Time Euclid Compiler, Student Project Report, Department of Computer Science, University of Toronto, August 1986.

    Google Scholar 

  40. 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 

  41. 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 

  42. DIN 66 253, Programmiersprache PEARL — Mehrrechner-PEARL, Teil 3, Berlin: Beuth-Verlag 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Alexander D. Stoyenko

  2. Department of Mathematics and Computing Science, University of Groningen, P.O. Box 800, 9700 AV, Groningen, The Netherlands

    Wolfgang A. Halang

Authors
  1. Alexander D. Stoyenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang A. Halang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Technische Informatik, TU Berlin, Franklinstr. 28/29, W-1000, Berlin 10, Deutschland

    G. Hommel

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stoyenko, A.D., Halang, W.A. (1991). Analysing PEARL Programs for Timely Schedulability and Executability. In: Hommel, G. (eds) Prozeßrechensysteme ’91. Informatik-Fachberichte, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76501-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76501-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53808-0

  • Online ISBN: 978-3-642-76501-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation