Skip to main content

Why the Expressive Power of Programming Languages Such as Ada Is Needed for Future Cyber Physical Systems

  • Conference paper
  • First Online:
Reliable Software Technologies – Ada-Europe 2016 (Ada-Europe 2016)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9695))

Included in the following conference series:

Abstract

If Cyber Physical Systems (CPS) are to be built with efficient resource utilisation it is imperative that they exploit the wealth of scheduling theory available. Many forms of real-time scheduling, and its associated analysis, are applicable to CPS, but it is not clear how the system developer/programmer can gain access to this theory when real CPS are being constructed. This short paper gives the background to the associated presentation where the facilities available in the Ada programming language are highlighted and reviewed. The aim of the presentation is to show that Ada provides most of the programming abstractions needed to deliver future CPS.

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

Access this chapter

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 EPUB and 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

References

  1. Aldea, M., Burns, A., Gutirrez, M., Harbour, M.G.: Incorporating the deadline floor protocol in Ada. ACM SIGAda Ada Lett. Proc. IRTAW 16 XXXIII(2), 49–58 (2013)

    Article  Google Scholar 

  2. Andersson, B., Jonsson, J.: Fixed-priority preemptive multiprocessor scheduling: to partition or not to partition. In: Proceedings of the International Conference on Real-Time Computing Systems and Applications (2000)

    Google Scholar 

  3. Baker, T.P.: A stack-based resource allocation policy for realtime processes. In: Proceedings of IEEE Real-Time Systems Symposium (RTSS), pp. 191–200 (1990)

    Google Scholar 

  4. Baker, T.P.: Stack-based scheduling of realtime processes. J. Real-Time Syst. 3(1), 37–99 (1991)

    Article  Google Scholar 

  5. Baruah, S.K.: A general model for recurring real-time tasks. In: rtss, p. 114. IEEE (1998)

    Google Scholar 

  6. Bernat, G., Burns, A.: Combining (n m)-hard deadlines with dual priority scheduling. In: Proceedings of 18th IEEE Real-Time Systems Symposium, pp. 46–57 (1997)

    Google Scholar 

  7. Bernat, G., Burns, A.: New results on fixed priority aperiodic servers. In: Proceedings of 20th IEEE Real-Time Systems Symposium, pp. 68–78 (1999)

    Google Scholar 

  8. Burns, A., Davis, R.I.: Mixed criticality systems: a review. Technical report MCC-1(e). Department of Computer Science, University of York (2015). http://www-users.cs.york.ac.uk/burns/review.pdf

  9. Burns, A., Davis, R.I., Wang, P., Zhang, F.: Partitioned EDF scheduling for multiprocessors using a C=D scheme. In: Proceedings of 18th International Conference on Real-Time and Network Systems (RTNS), pp. 169–178 (2010)

    Google Scholar 

  10. Burns, A., Davis, R.I., Wang, P., Zhang, F.: Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme. Real-Time Syst. J. 48(1), 3–33 (2012)

    Article  MATH  Google Scholar 

  11. Burns, A., Gutierrez, M., Aldea, M., González Harbour, M.: A deadline-floor inheritance protocol for EDF scheduled embedded real-time systems with resource sharing. IEEE Trans. Comput. 64(5), 1241–1253 (2015)

    Article  MathSciNet  Google Scholar 

  12. Burns, A., Prasad, D., Bondavalli, A., Di Giandomenico, F., Ramamritham, K., Stankovic, J., Stringini, L.: The meaning and role of value in scheduling flexible real-time systems. J. Syst. Archit. 46, 305–325 (2000)

    Article  Google Scholar 

  13. Burns, A., Wellings, A.J.: Dual priority scheduling in Ada 95 and real-time POSIX. In: Proceedings of the 21st IFAC/IFIP Workshop on Real-Time Programming, WRTP 1996, pp. 45–50 (1996)

    Google Scholar 

  14. Burns, A., Wellings, A.J.: Programming execution-time servers in Ada 2005. In: Proceedings of IEEE Real-Time Systems Symposium (RTSS), pp. 47–56 (2006)

    Google Scholar 

  15. Burns, A., Wellings, A.J.: Programming execution-time servers in Ada 2005. In: Proceedings of the 27th IEEE Real-Time Systems Symposium, pp. 47–56 (2006)

    Google Scholar 

  16. Buttazzo, G., Lipari, G., Abeni, L.: Elastic task model for adaptive rate control. In: IEEE Real-Time Systems Symposium, pp. 286–295 (1998)

    Google Scholar 

  17. Caccamo, M., Sha, L.: Aperiodic servers with resource constraints. In: Proceedings of the IEEE Real-Time Systems Symposium, December 2001

    Google Scholar 

  18. Davis, R.I., Bertogna, M.: Optimal fixed priority scheduling with deferred pre-emption. In: Proceedings of IEEE Real-Time Systems Symposium, pp. 39–50 (2012)

    Google Scholar 

  19. Davis, R.I., Burns, A.: Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: Proceedings of IEEE Real-Time Systems Symposium (RTSS), pp. 398–409 (2009)

    Google Scholar 

  20. Hagenauer, H., Martinek, N., Pohlmann, W.: Ada meets Giotto. In: Llamosí, A., Strohmeier, A. (eds.) Ada-Europe 2004. LNCS, vol. 3063, pp. 237–248. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  21. Henzinger, T.A., Horowitz, B., Kirsch, C.M.: Giotto: a time-triggered language for embedded programming. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, p. 166. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  22. Kato, S., Yamasaki, N.: Semi-partitioned fixed-priority scheduling on multiprocessors. In: IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 23–32 (2009)

    Google Scholar 

  23. Michell, S., Moore, B., Pinho, L.M.: Tasklettes – a fine grained parallelism for Ada on multicores. In: Keller, H.B., Plödereder, E., Dencker, P., Klenk, H. (eds.) Ada-Europe 2013. LNCS, vol. 7896, pp. 17–34. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  24. Prasad, D., Burns, A., Atkin, M.: The measurement and usage of utility in adaptive real-time systems. J. Real-Time Syst. 25(2/3), 277–296 (2003)

    Article  Google Scholar 

  25. Saifullah, A., Li, J., Agrawal, K., Lu, C., Gill, C.: Multi-core real-time scheduling for generalized parallel task models. Real-Time Syst. 49(4), 404–435 (2013)

    Article  MATH  Google Scholar 

  26. Sprunt, B., Sha, L., Lehoczky, J.P.: Aperiodic task scheduling for hard real-time systems. J. Real-Time Syst. 1, 27–69 (1989)

    Article  Google Scholar 

  27. Wellings, A., Burns, A.: The evolution of real-time programming revisited: programming the Giotto model in Ada 2005. In: Real, J., Vardanega, T. (eds.) Ada-Europe 2010. LNCS, vol. 6106, pp. 196–207. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  28. Zuhily, A., Burns, A.: Exact scheduling analysis of non-accumulatively monotonic multiframe tasks. Real-Time Syst. J. 43, 119–146 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alan Burns .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Burns, A. (2016). Why the Expressive Power of Programming Languages Such as Ada Is Needed for Future Cyber Physical Systems. In: Bertogna, M., Pinho, L., Quiñones, E. (eds) Reliable Software Technologies – Ada-Europe 2016. Ada-Europe 2016. Lecture Notes in Computer Science(), vol 9695. Springer, Cham. https://doi.org/10.1007/978-3-319-39083-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39083-3_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39082-6

  • Online ISBN: 978-3-319-39083-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics