Skip to main content

An Empirical Investigation of Eager and Lazy Preemption Approaches in Global Limited Preemptive Scheduling

  • Conference paper
  • First Online:
Book cover 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

Global limited preemptive real-time scheduling in multiprocessor systems using Fixed Preemption Points (FPP) brings in an additional challenge with respect to the choice of the task to be preempted in order to maximize schedulability. Two principal choices with respect to the preemption approach exist (1) the scheduler waits for the lowest priority job to become preemptible, (2) the scheduler preempts the first job, among the lower priority ones, that becomes preemptible. We refer to the former as the Lazy Preemption Approach (LPA) and the latter as the Eager Preemption Approach (EPA). Each of these choice has a different effect on the actual number of preemptions in the schedule, that in turn determine the runtime overheads.

In this paper, we perform an empirical comparison of the run-time preemptive behavior of Global Preemptive Scheduling and Global Limited Preemptive Scheduling with EPA and LPA, under both Earliest Deadline First (EDF) and Fixed Priority Scheduling (FPS) paradigms. Our experiments reveal interesting observations some of which are counter-intuitive. We then analyse the counter-intuitive observations and identify the associated reasons. The observations presented facilitate the choice of appropriate strategies when using limited preemptive schedulers on multiprocessor systems.

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. Baruah, S., Bertogna, M., Buttazzo, G.: Multiprocessor Scheduling for Real-Time Systems. Embedded Systems. Springer International Publishing, Switzerland (2015)

    Book  MATH  Google Scholar 

  2. Bastoni, A., Brandenburg, B.B., Anderson, J.H.: Cache-related preemption, migration delays: empirical approximation and impact on schedulability. In: The International Workshop OSPERT (2010)

    Google Scholar 

  3. Block, A., Leontyev, H., Brandenburg, B.B., Anderson, J.H.: A flexible real-time locking protocol for multiprocessors. In: The 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

    Google Scholar 

  4. Borchert, C., Schirmeier, H., Spinczyk, O.: Generative software-based memory error detection and correction for operating system data structures. In: The 43rd International Conference on Dependable Systems and Networks, June 2013

    Google Scholar 

  5. Brandenburg, B.B.: Scheduling and locking in multiprocessor real-time operating systems. Ph.D. thesis, University of North Carolina at Chapel Hill (2011)

    Google Scholar 

  6. Bril, R.J., Lukkien, J.J., Verhaegh, W.F.J.: Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Syst. 42, 63–119 (2009)

    Article  MATH  Google Scholar 

  7. Burns, A., Davis, R.: Mixed criticality systems - a review. http://www-users.cs.york.ac.uk/burns/review.pdf. Accessed 31 July 2015

  8. Buttazzo, G.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Real-Time Systems Series, vol. 24. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  9. Buttazzo, G.: Rate monotonic vs. EDF: judgment day. Real-Time Syst. 29, 5–26 (2005)

    Article  MATH  Google Scholar 

  10. Buttazzo, G.C., Bertogna, M., Yao, G.: Limited preemptive scheduling for real-time systems: a survey. IEEE Trans. Ind. Inform. 9, 3–15 (2012)

    Article  Google Scholar 

  11. Chattopadhyay, B., Baruah, S.: Limited-preemption scheduling on multiprocessors. In: The 22nd International Conference on Real-Time Networks and Systems. ACM (2014)

    Google Scholar 

  12. Davis, R., Burns, A., Marinho, J., Nelis, V., Petters, S., Bertogna, M.: Global fixed priority scheduling with deferred pre-emption. In: The International Conference on Embedded and Real-Time Computing Systems and Applications (2013)

    Google Scholar 

  13. Davis, R.I., Burns, A.: Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real-Time Syst. 47, 1–40 (2011)

    Article  MATH  Google Scholar 

  14. Davis, R.I., Burns, A., Marinho, J., Nelis, V., Petters, S.M., Bertogna, M.: Global and partitioned multiprocessor fixed priority scheduling with deferred preemption. ACM Trans. Embed. Comput. Syst. 14, 47 (2015)

    Article  Google Scholar 

  15. dos Santos Marinho, J. M.S.: Real-time limited preemptive scheduling. In Ph.D. thesis, FEUP Porto (2015)

    Google Scholar 

  16. Marinho, J., Nelis, V., Petters, S., Bertogna, M., Davis, R.: Limited pre-emptive global fixed task priority. In: The Real-time Systems Symposium (2013)

    Google Scholar 

  17. Nie, Y.: Limited-preemptive fixed priority scheduling of real-time tasks on multiprocessors. Master thesis, Malardalen University (2015)

    Google Scholar 

  18. Peng, B., Fisher, N., Bertogna, M.: Explicit preemption placement for real-timeconditional code. In: The Euromicro Conference on Real-Time Systems, July 2014

    Google Scholar 

  19. Short, M.: The case for non-preemptive, deadline-driven scheduling in real-time embedded systems. In: Lecture Notes in Engineering and Computer Science: Proceedings of the World Congress on Engineering (2010)

    Google Scholar 

  20. Thekkilakattil, A., Baruah, S., Dobrin, R., Punnekkat, S.: The global limited preemptive earliest deadline first feasibility of sporadic real-time tasks. In: The 26th Euromicro Conference on Real-Time Systems, July 2014

    Google Scholar 

  21. Thekkilakattil, A., Davis, R., Dobrin, R., Punnekkat, S., Bertogna, M.: Multiprocessor fixed priority scheduling with limited preemptions. In: The 23rd International Conference on Real-Time Networks and Systems (2015)

    Google Scholar 

  22. Thekkilakattil, A., Zhu, K., Nie, Y., Dobrin, R., Punnekkat, S.: An empirical investigation of eager and lazy preemption approaches in global limited preemptive scheduling. Technical report, September 2015. http://www.es.mdh.se/publications/4057-

  23. Zhu, K.: Limited-preemptive EDF scheduling of real-time tasks on multiprocessors. Master thesis, Malardalen University (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Abhilash Thekkilakattil .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Thekkilakattil, A., Zhu, K., Nie, Y., Dobrin, R., Punnekkat, S. (2016). An Empirical Investigation of Eager and Lazy Preemption Approaches in Global Limited Preemptive Scheduling. 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_11

Download citation

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

  • 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