Skip to main content

Data Age Diminution in the Logical Execution Time Model

  • Conference paper
Architecture of Computing Systems – ARCS 2016 (ARCS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9637))

Included in the following conference series:

Abstract

The logical execution time (LET) model separates logical from physical execution times. Furthermore, tasks’ input and output of data occurs at predictable times that are the tasks’ arrival times and deadlines, respectively. The output of data is delayed until the period end meaning that output times have no jitter. The delayed output affects the freshness of data (respectively data age) between interacting tasks. Recently, critics from control theory arise that the LET approach provides outdated data. We analyze the data age of communicating tasks and propose an approach that reduces the data age. Therefore, we reduce the LET of tasks such that output data is provided earlier than at a task’s deadline, but still preserve the predictability of output times. To confirm the improvement on the data age, we simulate 100 randomly generated task sets. Moreover, we also simulate a task set of a real-world automotive benchmark and show an enhancement of the average data age of approximately 33 % with our approach compared to the LET model.

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. Audsley, N., Burns, A., Richardson, M., Tindell, K., Wellings, A.J.: Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Eng. J. 8(5), 284–292 (1993)

    Article  Google Scholar 

  2. Audsley, N.C., Burns, A., Richardson, M.F., Wellings, A.J.: Hard real-time scheduling: the deadline-monotonic approach. In: Workshop on Real-Time Operating Systems and Software, pp. 133–137 (1991)

    Google Scholar 

  3. Farcas, E., Farcas, C., Pree, W., Templ, J.: Transparent distribution of real-time components based on logical execution time. ACM SIGPLAN Not. 40(7), 31–39 (2005)

    Article  Google Scholar 

  4. Goossens, J., Macq, C.: Limitation of the hyper-period in real-time periodic task set generation. In: RTS Embedded Systems, pp. 133–148 (2001)

    Google Scholar 

  5. Halbwachs, N.: Synchronous Programming of Reactive Systems. Kluwer Academic Publishers, Norwell (1992)

    MATH  Google Scholar 

  6. Henzinger, T.A., Horowitz, B., Kirsch, C.M.: Embedded control systems development with giotto. In: Workshop on Languages, Compilers and Tools for Embedded Systems (LCTES), LCTES 2001, pp. 64–72. ACM, New York, NY, USA (2001)

    Google Scholar 

  7. 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, pp. 166–184. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Kirsch, C.M.: Principles of real-time programming. In: Sangiovanni-Vincentelli, A., Sifakis, J. (eds.) EMSOFT 2002. LNCS, vol. 2491, pp. 61–75. Springer, Heidelberg (2002)

    Google Scholar 

  9. Kirsch, C.M., Sengupta, R.: The evolution of real-time programming. In: Handbook of Real-Time and Embedded Systems, pp. 11-1–11-23. Chapman & Hall/CRC Computer and Information Science Series, CRC Press, Boca Raton (2007)

    Google Scholar 

  10. Kirsch, C.M., Sokolova, A.: The logical execution time paradigm. In: Advances in Real-Time Systems, pp. 103–120. Springer, Heidelberg (2012)

    Google Scholar 

  11. Kloda, T., d’Ausbourg, B., Santinelli, L.: EDF schedulability analysis for an extended timing definition language. In: Symposium on Industrial Embedded Systems (SIES), pp. 30–40, June 2014

    Google Scholar 

  12. Kloda, T., d’Ausbourg, B., Santinelli, L.: Towards a more flexible timing definition language. In: Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL) (2014)

    Google Scholar 

  13. Kluge, F.: tms-sim – timing models scheduling simulation framework. Technical Report 2014-07, Universität Augsburg, December 2014

    Google Scholar 

  14. Kluge, F., Neuerburg, M., Ungerer, T.: Utility-based scheduling of \((m,k)\)-firm real-time task sets. In: Architecture of Computing Systems (ARCS), March 2015

    Google Scholar 

  15. Kramer, S., Ziegenbein, D., Hamann, A.: Real world automotive benchmarks for free. In: Workshop on Analysis Tools and Methodologies for Embedded and Real-Time Systems (WATERS), July 2015

    Google Scholar 

  16. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  17. Potop-Butucaru, D., de Simone, R., Talpin, J.P.: The synchronous hypothesis and synchronous languages. In: Embedded Systems Handbook. pp. 8-1–8-23. CRC Press, Boca Raton, August 2005

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christian Bradatsch .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bradatsch, C., Kluge, F., Ungerer, T. (2016). Data Age Diminution in the Logical Execution Time Model. In: Hannig, F., Cardoso, J.M.P., Pionteck, T., Fey, D., Schröder-Preikschat, W., Teich, J. (eds) Architecture of Computing Systems – ARCS 2016. ARCS 2016. Lecture Notes in Computer Science(), vol 9637. Springer, Cham. https://doi.org/10.1007/978-3-319-30695-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30695-7_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30694-0

  • Online ISBN: 978-3-319-30695-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics