Skip to main content
Springer Nature Link
Log in

Effective Scheduling of Strict Periodic Task Sets with Given Permissible Periods in RTOS

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 2019)

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

Abstract

In the paper, we suggest new approach to schedulability problem for strict periodic tasks (a periodic task is strict if it must be started in equal intervals of time – task’s period). Given permissible tasks’ periods, our approach allows to obtain quickly all schedulable sets of tasks with such periods and to build immediately a conflict-free schedule for each obtained set. The approach is based on mathematical methods of graph theory and number theory. We illustrate the approach by a number of examples and present current practical results.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Scheduling is called static, if the schedule is built before running the system.

  2. 2.

    Task is called preemptive, if it may be interrupted by another task.

References

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

    Article  MathSciNet  Google Scholar 

  2. Yomsi, P.M., Sorel, Y.: Non-schedulability conditions for off-line scheduling of real-time systems subject to precedence and strict periodicity constraints. In: Proceedings of the 11th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2006, Prague (2006)

    Google Scholar 

  3. Yomsi, P.M., Sorel, Y.: Schedulability analysis for non necessarily harmonic real-time systems with precedence and strict periodicity constraints using the exact number of preemptions and no idle time. In: Proceedings of the 4th Multidisciplinary International Scheduling Conference, MISTA 2009, Dublin, Ireland (2009)

    Google Scholar 

  4. Zelenov, S.V.: Scheduling of strictly periodic tasks in real-time systems. Trudy ISP RAN. Proc. ISP RAS 20, 113–122 (2011). (in Russian)

    Google Scholar 

  5. Tretyakov, A.V.: Automation of scheduling for periodic real-time systems. Trudy ISP RAN. Proc. ISP RAS 22, 375–400 (2012). (in Russian)

    Article  Google Scholar 

  6. Zelenova, S.A., Zelenov, S.V.: Non-conflict scheduling criterion for strict periodic tasks. Trudy ISP RAN. Proc. ISP RAS 29(6), 183–202 (2017). https://doi.org/10.15514/ISPRAS-2017-29(6)-10. (in Russian)

    Article  Google Scholar 

  7. Zelenova, S.A., Zelenov, S.V.: Schedulability analysis for strictly periodic tasks in RTOS. Program. Comput. Softw. 44(3), 159–169 (2018). https://doi.org/10.1134/S0361768818030076

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ivannikov Institute for System Programming of the Russian Academy of Sciences (ISP RAS), 25, Alexander Solzhenitsyn st., Moscow, 109004, Russia

    Sophia A. Zelenova & Sergey V. Zelenov

  2. National Research University Higher School of Economics (HSE), 20, Myasnitskaya Ulitsa, Moscow, 101000, Russia

    Sergey V. Zelenov

Authors
  1. Sophia A. Zelenova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey V. Zelenov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergey V. Zelenov .

Editor information

Editors and Affiliations

  1. Microsoft Research, Redmond, WA, USA

    Nikolaj Bjørner

  2. AP Ershov Institute of Informatics Systems, Novosibirsk, Russia

    Irina Virbitskaite

  3. School of Computer Science, University of Manchester, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zelenova, S.A., Zelenov, S.V. (2019). Effective Scheduling of Strict Periodic Task Sets with Given Permissible Periods in RTOS. In: Bjørner, N., Virbitskaite, I., Voronkov, A. (eds) Perspectives of System Informatics. PSI 2019. Lecture Notes in Computer Science(), vol 11964. Springer, Cham. https://doi.org/10.1007/978-3-030-37487-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37487-7_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37486-0

  • Online ISBN: 978-3-030-37487-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics