Skip to main content
SpringerLink
Log in
Book cover

International Conference On Principles Of Distributed Systems

OPODIS 2008: Principles of Distributed Systems pp 73–88Cite as

Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%

  • Conference paper

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

Abstract

Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.

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. Gallmeister, B.: POSIX.4 Programmers Guide: Programming for the Real World. O’Reilly Media, Sebastopol (1995)

    Google Scholar 

  2. Sha, L., Rajkumar, R., Sathaye, S.: Generalized Rate-Monotonic Scheduling Theory: A Framework for Developing Real-Time Systems. Proceedings of the IEEE 82, 68–82 (1994)

    Article  Google Scholar 

  3. Tindell, K.W.: An Extensible Approach for Analysing Fixed Priority Hard Real-Time Tasks. Technical Report, Department of Computer Science, University of York, UK YCS 189 (1992)

    Google Scholar 

  4. Liu, C.L., Layland, J.W.: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. Technical Report, Department of Computer Science, University of York, UK YCS 189., 1992. Journal of the ACM, vol. 20, pp. 46–61 (1973)

    Google Scholar 

  5. Oh, D., Baker, T.P.: Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment. Real-Time Systems 5, 183–192 (1998)

    Article  Google Scholar 

  6. Dhall, S., Liu, C.: On a real-time scheduling problem. Operations Research 6, 127–140 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Baker, T.P.: An Analysis of Fixed-Priority Schedulability on a Multiprocessor. Real-Time Systems 32, 49–71 (2006)

    Article  MATH  Google Scholar 

  8. Bertogna, M., Cirinei, M.: Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms. In: IEEE Real-Time Systems Symposium, Tucson, Arizona (2007)

    Google Scholar 

  9. Bertogna, M., Cirinei, M., Lipari, G.: New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors. In: 9th International Conference on Principles of Distributed Systems, Pisa, Italy (2005)

    Google Scholar 

  10. Cucu, L.: Optimal priority assignment for periodic tasks on unrelated processors. In: Euromicro Conference on Real-Time Systems (ECRTS 2008), WIP session, Prague, Czech Republic (2008)

    Google Scholar 

  11. Andersson, B., Baruah, S., Jonsson, J.: Static-Priority Scheduling on Multiprocessors. In: IEEE Real-Time Systems Symposium, London, UK (2001)

    Google Scholar 

  12. Lundberg, L.: Analyzing Fixed-Priority Global Multiprocessor Scheduling. In: Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2002) (2002)

    Google Scholar 

  13. Andersson, B., Jonsson, J.: The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In: Euromicro Conference on Real-Time Systems, Porto, Portugal (2003)

    Google Scholar 

  14. Liu, C.L.: Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60, 28–31 (1969)

    Google Scholar 

  15. Ha, R., Liu, J.W.S.: Validating timing constraints in multiprocessor and distributed real-time systems. In: Proceedings of the 14th International Conference on Distributed Computing Systems, Pozman, Poland (1994)

    Google Scholar 

  16. Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: ACM Symposium on Theory of Computing, El Paso, Texas, United States (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IPP Hurray Research Group, Polytechnic Institute of Porto, Portugal

    Björn Andersson

Authors
  1. Björn Andersson
    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

Andersson, B. (2008). Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%. 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_7

Download citation

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

  • 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