Skip to main content
SpringerLink
Log in

Utility-Based Scheduling of \((m,k)\)-Firm Real-Time Task Sets

  • Conference paper
  • First Online:
Architecture of Computing Systems – ARCS 2015 (ARCS 2015)

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

Included in the following conference series:

Abstract

The concept of a firm real-time task implies the notion of a firm deadline that should not be missed by the jobs of this task. If a deadline miss occurs, the concerned job yields no value to the system. It turns out that for some application domains, this restrictive notion can be relaxed. For example, robust control systems can tolerate that single executions of a control loop miss their deadlines, and still yield an acceptable behaviour. Thus, systems can be developed under more optimistic assumptions, e.g. by allowing overloads. However, care must be taken that deadline misses do not accumulate. This restriction can be expressed by the model of \((m,k)\)-firm real-time tasks that require that within any \(k\) successive jobs at least \(m\) jobs are executed successfully. This paper presents the heuristic utility-based algorithm MKU for scheduling sets of \((m,k)\)-firm real-time tasks. Therefore, MKU uses history-cognisant utility functions. Simulations show that for moderate overloads, MKU achieves a higher schedulability ratio than other schedulers developed for \((m,k)\)-firm real-time tasks.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldarmi, S.A., Burns, A.: Dynamic value-density for scheduling real-time systems. In: Proceedings of the 11th Euromicro Conference on Real-Time Systems, pp. 270–277 (1999)

    Google Scholar 

  2. Baums, A.: Indicators of the real time of a mobile autonomous robot. Automatic Control and Computer Sciences 46(6), 261–267 (2012)

    Article  Google Scholar 

  3. Bernat, G., Burns, A., Liamosi, A.: Weakly hard real-time systems. IEEE Transactions on Computers 50(4), 308–321 (2001)

    Article  Google Scholar 

  4. Buttazzo, G., Spuri, M., Sensini, F.: Value vs. deadline scheduling in overload conditions. In: Proceedings of the 16th IEEE Real-Time Systems Symposium, pp. 90–99 (1995)

    Google Scholar 

  5. Camponogara, E., de Oliveira, A.B., Lima, G.: Optimization-Based Dynamic Reconfiguration of Real-Time Schedulers With Support for Stochastic Processor Consumption. IEEE Transactions on Industrial Informatics 6(4), 594–609 (2010)

    Article  Google Scholar 

  6. Chen, H., Xia, J.: A real-time task scheduling algorithm based on dynamic priority. In: International Conference on Embedded Software and Systems, ICESS 2009, pp. 431–436 (2009)

    Google Scholar 

  7. Chen, K., Muhlethaler, P.: A scheduling algorithm for tasks described by time value function. Real-Time Systems 10, 293–312 (1996). doi:10.1007/BF00383389

    Article  Google Scholar 

  8. Cho, H., Chung, Y., Park, D.: Guaranteed dynamic priority assignment scheme for streams with (m, k)-firm deadlines. ETRI Journal 32(3), 500–502 (2010)

    Article  Google Scholar 

  9. Clark, R.K.: Scheduling Dependent Real-Time Activities. Ph.D. thesis, Carnegie Mellon University (August 1990)

    Google Scholar 

  10. Ding, W., Guo, R.: Design and evaluation of sectional real-time scheduling algorithms based on system load. In: The 9th International Conference for Young Computer Scientists, ICYCS 2008, pp. 14–18 (2008)

    Google Scholar 

  11. Ekelin, C.: Clairvoyant non-preemptive edf scheduling. In: Proceedings of the 18th Euromicro Conference on Real-Time Systems, ECRTS 2006, Dresden, Germany, July, 5–7, pp. 23–32. IEEE Computer Society (2006)

    Google Scholar 

  12. Flavia, F., Ning, J., Simonot-Lion, F., YeQiong, S.: Optimal on-line (m, k)-firm constraint assignment for real-time control tasks based on plant state information. In: IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2008, pp. 908–915 (2008)

    Google Scholar 

  13. Goossens, J.: \((m, k)\)-firm constraints and dbp scheduling: Impact of the initial k-sequence and exact feasibility test. In: 16th International Conference on Real-Time and Network Systems (RTNS 2008), pp. 61–66, October 2008

    Google Scholar 

  14. Hamdaoui, M., Ramanathan, P.: A dynamic priority assignment technique for streams with (m, k)-firm deadlines. IEEE Transactions on Computers 44(12), 1443–1451 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Jensen, E.D., Locke, C.D., Tokuda, H.: A time-driven scheduling model for real-time operating systems. In: 6th Real-Time Systems Symposium (RTSS 1985), San Diego, California, USA, December 3–6, pp. 112–122, December 1985

    Google Scholar 

  16. Jia, N., Song, Y.Q., Simonot-Lion, F.: Task handler based on (m, k)-firm constraint model for managing a set of real-time controllers. In: Navet, N., Simonot-Lion, F., Puaut, I. (eds.) 15th International Conference on Real-Time and Network Systems - RTNS 2007, Nancy, France, pp. 183–19 (2007)

    Google Scholar 

  17. Kluge, F.: tms-sim - timing models scheduling simulation framework - release 2014–12. Tech. Rep. 2014–07, University of Augsburg (December 2014)

    Google Scholar 

  18. Kluge, F., Haas, F., Gerdes, M., Ungerer, T.: History-cognisant time-utility-functions for scheduling overloaded real-time control systems. In: Proceedings of the 7th Junior Researcher Workshop on Real-Time Computing (JRWRTC 2013), Sophia Antipolis, France, October 16, October 2013

    Google Scholar 

  19. Koren, G., Shasha, D.: Dover; an optimal on-line scheduling algorithm for overloaded real-time systems. In: Real-Time Systems Symposium, pp. 290–299 (1992)

    Google Scholar 

  20. Koren, G., Shasha, D.: Skip-over: algorithms and complexity for overloaded systems that allow skips. In: Proceedings of the 16th IEEE Real-Time Systems Symposium, pp. 110–117 (1995)

    Google Scholar 

  21. Li, P., Wu, H., Ravindran, B., Jensen, E.D.: A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints. IEEE Transactions on Computers 55(4), 454–469 (2006)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  23. Locke, C.D.: Best-effort decision-making for real-time scheduling. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1986)

    Google Scholar 

  24. Mejía-Alvarez, P., Melhem, R., Mossé, D.: An incremental approach to scheduling during overloads in real-time systems. In: Proceedings of the 21st IEEE Real-Time Systems Symposium, pp. 283–293 (2000)

    Google Scholar 

  25. Mosse, D., Pollack, M.E., Ronen, Y.: Value-density algorithms to handle transient overloads in scheduling. In: Proceedings of the 11th Euromicro Conference on Real-Time Systems, pp. 278–286 (1999)

    Google Scholar 

  26. Quan, G., Hu, X.: Enhanced fixed-priority scheduling with (m, k)-firm guarantee. In: Proceedings of the 21st IEEE Real-Time Systems Symposium, pp. 79–88 (2000)

    Google Scholar 

  27. Ramanathan, P.: Overload management in real-time control applications using (m, k)-firm guarantee. IEEE Transactions on Parallel and Distributed Systems 10(6), 549–559 (1999)

    Article  Google Scholar 

  28. Ravindran, B., Jensen, E.D., Li, P.: On recent advances in time/utility function real-time scheduling and resource management. In: Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, ISORC 2005, pp. 55–60 (2005)

    Google Scholar 

  29. Semprebom, T., Montez, C., Vasques, F.: (m, k)-firm pattern spinning to improve the gts allocation of periodic messages in ieee 802.15.4 networks. EURASIP Journal on Wireless Communications and Networking 2013(1), 1–15 (2013)

    Article  Google Scholar 

  30. Wang, J., Ravindran, B.: Time-utility function-driven switched ethernet: packet scheduling algorithm, implementation, and feasibility analysis. IEEE Transactions on Parallel and Distributed Systems 15(2), 119–133 (2004)

    Article  Google Scholar 

  31. West, R., Schwan, K.: Dynamic window-constrained scheduling for multimedia applications. In: IEEE International Conference on Multimedia Computing and Systems, vol. 2, pp. 87–91, July 1999

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Augsburg, Augsburg, Germany

    Florian Kluge, Markus Neuerburg & Theo Ungerer

Authors
  1. Florian Kluge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Neuerburg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Theo Ungerer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florian Kluge .

Editor information

Editors and Affiliations

  1. CISTER/INESC TEC, ISEP Research Center, Porto, Portugal

    Luís Miguel Pinho Pinho

  2. Karlsruher Institut für Technologie, Karlsruhe, Germany

    Wolfgang Karl

  3. Inria and École Normale Supérieure, Paris, France

    Albert Cohen

  4. Goethe University Fachbereich Informatik und Mathematik, Frankfurt am Main, Germany

    Uwe Brinkschulte

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kluge, F., Neuerburg, M., Ungerer, T. (2015). Utility-Based Scheduling of \((m,k)\)-Firm Real-Time Task Sets. In: Pinho, L., Karl, W., Cohen, A., Brinkschulte, U. (eds) Architecture of Computing Systems – ARCS 2015. ARCS 2015. Lecture Notes in Computer Science(), vol 9017. Springer, Cham. https://doi.org/10.1007/978-3-319-16086-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-16086-3_16

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation