Skip to main content
SpringerLink
Log in

Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks

  • Conference paper
  • First Online:
Combinatorial Algorithms (IWOCA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13270))

Included in the following conference series:

Abstract

In some important application areas of hard real-time systems, e.g., avionics, automotive, industrial controls, and robotics, preemptive sporadic tasks with harmonic periods and constrained deadlines running on a uni-processor platform play an important role. For such applications we have to check the system task set for guaranteed compliance with deadlines. For this purpose, we present a new algorithm that has a lower computational complexity than known algorithms for the same system class. For this we determine the worst-case response time for each task with a linear computational complexity in the number of tasks, if the task priorities are defined according to their periodic request rates. Otherwise we have to add the time for task ordering.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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, 284–292 (1993)

    Article  Google Scholar 

  2. Bini, E., Parri, A., Dossena, G.: A quadratic-time response time upper bound with a tightness property. In: Proceedings of the IEEE International Real-Time Systems Symposium (RTSS 2015), San Antonio, TX, USA, December 2015

    Google Scholar 

  3. Bonifaci, V., Marchetti-Spaccamela, A., Megow, N., Wiese, A.: Polynomial-time exact schedulability tests for harmonic real-time tasks. In: RTSS 2013, pp. 236–245 (2013)

    Google Scholar 

  4. Davis, R.I., Zabos, A., Burns, A.: Efficient exact schedulability tests for fixed priority real-time systems. IEEE Trans. Comput. 57(9), 1261–1276 (2008). http://doi.ieeecomputersociety.org/10.1109/TC.2008.66

  5. Davis, R., Burns, A.: Response time upper bounds for fixed priority real-time systems. In: Proceedings of the IEEE International Real-Time Systems Symposium (RTSS 2008), pp. 407–418 (2008). https://doi.org/10.1109/RTSS.2008.18

  6. Eisenbrand, F., Rothvoss, T.: Static-priority real-time scheduling: response time computation is NP-hard. In: Proceedings of the 29th IEEE Real-Time Systems Symposium, RTSS 2008, Barcelona, Spain, 30 November–3 December 2008, pp. 397–406. IEEE Computer Society (2008). https://doi.org/10.1109/RTSS.2008.25

  7. Fineberg, M., Serlin, O.: Multiprogramming for hybrid computation. In: Proceedings of the AFIPS Fall Joint Computing Conference, pp. 1–13 (1967)

    Google Scholar 

  8. Joseph, M., Pandya, P.: Finding response times in a real-time system. Comput. J. 29(5), 390–395 (1986). https://doi.org/10.1093/comjnl/29.5.390. http://comjnl.oxfordjournals.org/content/29/5/390.abstract

  9. Kuo, T., Mok, A.: Load adjustment in adaptive real-time systems. In: Proceedings of the IEEE International Real-Time Systems Symposium (RTSS 1991), pp. 160–170, December 1991. https://doi.org/10.1109/REAL.1991.160369

  10. Lehoczky, J.: Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the IEEE International Real-Time Systems Symposium (RTSS 1990), pp. 201–209 (1990). https://doi.org/10.1109/REAL.1990.128748

  11. Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proceedings of the IEEE International Real-Time System Symposium (RTSS 1989) pp. 166–171 (1989)

    Google Scholar 

  12. Liu, C., Layland, J.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973). https://doi.org/10.1145/321738.321743. http://doi.acm.org/10.1145/321738.321743

  13. Lu, W., Hsieh, J., Shih, W., Kuo, T.: A faster exact schedulability analysis for fixed-priority scheduling. J. Syst. Softw. 79(12), 1744–1753 (2006). https://doi.org/10.1016/j.jss.2006.03.023

    Article  Google Scholar 

  14. Lu, W., Hsieh, J., Shih, W.K.: A precise schedulability test algorithm for scheduling periodic tasks in real-time systems. In: Proceedings of the 2006 ACM Symposium on Applied Computing, SAC 2006, pp. 1451–1455. ACM, New York (2006). https://doi.org/10.1145/1141277.1141616. http://doi.acm.org/10.1145/1141277.1141616

  15. Sjodin, M., Hansson, H.: Improved response-time analysis calculations. In: Proceedings of the IEEE International Real-Time Systems Symposium (RTSS 1998), pp. 399–408 (1998). https://doi.org/10.1109/REAL.1998.739773

  16. Tindell, K., Burns, A., Wellings, A.J.: An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Syst. 6(2), 133–151 (1994). https://doi.org/10.1007/BF01088593

  17. Xu, Y., Cervin, A., Arzén, K.E.: LQG-based scheduling and control co-design using harmonic task periods. Technical Reports TFRT-7646, Department of Automatic Control, Lund Institute of Technology, Lund University (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Thang Long University (TLU), Dai Kim, Hoang Mai, Hanoi, Vietnam

    Thi Huyen Chau Nguyen

  2. Faculty of Computer Science and Mathematics, University of Passau, Passau, Germany

    Werner Grass

  3. Department of Computer Science, Christian-Albrechts-University Kiel, Kiel, Germany

    Klaus Jansen

Authors
  1. Thi Huyen Chau Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Grass
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Klaus Jansen .

Editor information

Editors and Affiliations

  1. Université Paris-Dauphine, Paris, France

    Cristina Bazgan

  2. Universität Trier, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nguyen, T.H.C., Grass, W., Jansen, K. (2022). Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks. In: Bazgan, C., Fernau, H. (eds) Combinatorial Algorithms. IWOCA 2022. Lecture Notes in Computer Science, vol 13270. Springer, Cham. https://doi.org/10.1007/978-3-031-06678-8_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-06678-8_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-06677-1

  • Online ISBN: 978-3-031-06678-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation