Skip to main content
SpringerLink
Log in
Book cover

International Conference On Principles Of Distributed Systems

OPODIS 2008: Principles of Distributed Systems pp 89–104Cite as

Deadline Monotonic Scheduling on Uniform Multiprocessors

  • Conference paper

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

Abstract

The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.

Supported in part by NSF Grant Nos. CNS-0834270, CNS-0834132, CCF-0541056, and CCR-0615197, ARO Grant No. W911NF-06-1-0425, and funding from IBM and the Intel Corporation.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mok, A.K.: Fundamental Design Problems of Distributed Systems for The Hard-Real-Time Environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology, Available as Technical Report No. MIT/LCS/TR-297 (1983)

    Google Scholar 

  2. Baruah, S., Mok, A., Rosier, L.: Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, pp. 182–190. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  3. Baruah, S., Cohen, N., Plaxton, G., Varvel, D.: Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15(6), 600–625 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Oh, D.I., Baker, T.P.: Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Systems: The International Journal of Time-Critical Computing 15, 183–192 (1998)

    Article  Google Scholar 

  5. Lopez, J.M., Garcia, M., Diaz, J.L., Garcia, D.F.: Worst-case utilization bound for EDF scheduling in real-time multiprocessor systems. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Stockholm, Sweden, pp. 25–34. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  6. Andersson, B., Jonsson, J.: Fixed-priority preemptive multiprocessor scheduling: To partition or not to partition. In: Proceedings of the International Conference on Real-Time Computing Systems and Applications, Cheju Island, South Korea, pp. 337–346. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  7. Andersson, B., Baruah, S., Jonsson, J.: Static-priority scheduling on multiprocessors. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 193–202. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  8. Goossens, J., Funk, S., Baruah, S.: Priority-driven scheduling of periodic task systems on multiprocessors. Real Time Systems 25(2–3), 187–205 (2003)

    Article  MATH  Google Scholar 

  9. Lopez, J.M., Diaz, J.L., Garcia, D.F.: Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Systems: The International Journal of Time-Critical Computing 28(1), 39–68 (2004)

    Article  MATH  Google Scholar 

  10. Funk, S.H.: EDF Scheduling on Heterogeneous Multiprocessors. PhD thesis, Department of Computer Science, The University of North Carolina at Chapel Hill (2004)

    Google Scholar 

  11. Baruah, S.: Scheduling periodic tasks on uniform processors. In: Proceedings of the EuroMicro Conference on Real-time Systems, Stockholm, Sweden, pp. 7–14 (June 2000)

    Google Scholar 

  12. Funk, S., Goossens, J., Baruah, S.: On-line scheduling on uniform multiprocessors. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 183–192. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  13. Baruah, S., Goossens, J.: Rate-monotonic scheduling on uniform multiprocessors. IEEE Transactions on Computers 52(7), 966–970 (2003)

    Article  Google Scholar 

  14. Funk, S., Baruah, S.: Task assignment on uniform heterogeneous multiprocessors. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Palma de Mallorca, Balearic Islands, Spain, pp. 219–226. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  15. Darera, V.N., Jenkins, L.: Utilization bounds for RM scheduling on uniform multiprocessors. In: RTCSA 2006: Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Washington, DC, USA, pp. 315–321. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  16. Andersson, B., Tovar, E.: Competitive analysis of partitioned scheduling on uniform multiprocessors. In: Proceedings of the Workshop on Parallel and Distributed Real-Time Systems, Long Beach, CA (March 2007)

    Google Scholar 

  17. Andersson, B., Tovar, E.: Competitive analysis of static-priority scheduling on uniform multiprocessors. In: Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Daegu, Korea. IEEE Computer Society Press, Los Alamitos (2007)

    Google Scholar 

  18. Baker, T.: Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the IEEE Real-Time Systems Symposium, pp. 120–129. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  19. Baker, T.P.: An analysis of EDF schedulability on a multiprocessor. IEEE Transactions on Parallel and Distributed Systems 16(8), 760–768 (2005)

    Article  Google Scholar 

  20. Bertogna, M., Cirinei, M., Lipari, G.: Improved schedulability analysis of EDF on multiprocessor platforms. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Palma de Mallorca, Balearic Islands, Spain, pp. 209–218. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  21. Bertogna, M., Cirinei, M., Lipari, G.: New schedulability tests for real-time tasks sets scheduled by deadline monotonic on multiprocessors. In: Proceedings of the 9th International Conference on Principles of Distributed Systems, Pisa, Italy. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  22. Cirinei, M., Baker, T.P.: EDZL scheduling analysis. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Pisa, Italy. IEEE Computer Society Press, Los Alamitos (2007)

    Google Scholar 

  23. Fisher, N.: The Multiprocessor Real-Time Scheduling of General Task Systems. PhD thesis, Department of Computer Science, The University of North Carolina at Chapel Hill (2007)

    Google Scholar 

  24. Baruah, S., Baker, T.: Schedulability analysis of global EDF. Real- Time Systems (to appear, 2008)

    Google Scholar 

  25. Baruah, S., Fisher, N.: Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 204–216. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Baruah, S., Baker, T.: Global EDF schedulability analysis of arbitrary sporadic task systems. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Prague, Czech Republic. IEEE Computer Society Press, Los Alamitos (2008)

    Google Scholar 

  27. Leung, J., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237–250 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  28. Baruah, S., Goossens, J.: The EDF scheduling of sporadic task systems on uniform multiprocessors. Technical report, University of North Carolina at Chapel Hill (2008)

    Google Scholar 

  29. Ripoll, I., Crespo, A., Mok, A.K.: Improvement in feasibility testing for real-time tasks. Real-Time Systems: The International Journal of Time-Critical Computing 11, 19–39 (1996)

    Article  Google Scholar 

  30. Baker, T.P., Fisher, N., Baruah, S.: Algorithms for determining the load of a sporadic task system. Technical Report TR-051201, Department of Computer Science, Florida State University (2005)

    Google Scholar 

  31. Fisher, N., Baruah, S., Baker, T.: The partitioned scheduling of sporadic tasks according to static priorities. In: Proceedings of the EuroMicro Conference on Real-Time Systems, Dresden, Germany. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  32. Fisher, N., Baker, T., Baruah, S.: Algorithms for determining the demand-based load of a sporadic task system. In: Proceedings of the International Conference on Real-time Computing Systems and Applications, Sydney, Australia. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of North Carolina at Chapel Hill, NC, USA

    Sanjoy Baruah

  2. Université Libre de Bruxelles, Brussels, Belgium

    Joël Goossens

Authors
  1. Sanjoy Baruah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joël Goossens
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Florida State University, 207A Love Building, PO Box 4530, FL 32306-4530, Tallahassee, USA

    Theodore P. Baker

  2. Université de Versailles-St-Quentin-en-Yvelines, 45, avenue des Etats-Unis, 78035, Versailles Cedex, France

    Alain Bui

  3. LIP6 & INRIA Grand Large, Université Pierre et Marie Curie - Paris 6, 104 avenue du Président Kennedy, 75016, Paris, France

    Sébastien Tixeuil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baruah, S., Goossens, J. (2008). Deadline Monotonic Scheduling on Uniform Multiprocessors. In: Baker, T.P., Bui, A., Tixeuil, S. (eds) Principles of Distributed Systems. OPODIS 2008. Lecture Notes in Computer Science, vol 5401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92221-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92221-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92220-9

  • Online ISBN: 978-3-540-92221-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation