Skip to main content
SpringerLink
Log in

Provably good multiprocessor scheduling with resource sharing

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

We present a 12(1+3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baruah S, Bonifaci V, Marchetti-Spaccamela A, Stiller S (2009) Implementation of a speedup-optimal global EDF schedulability test. In: Proceedings of Euromicro conference on real-time systems, pp 259–268

  • Block A, Leontyev H, Brandenburg BB, Anderson JH (2007) A flexible real-time locking protocol for multiprocessors. In: Proceedings of real-time and embedded computing systems and applications conference, pp 47–56

  • Easwaran A, Andersson B (2009) Resource sharing in global fixed-priority preemptive multiprocessor scheduling. In: Proceedings of IEEE real-time systems symposium, pp 377–386

  • Gai P, Lipari G, Di Natale M (2001) Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In: Proceedings of IEEE real-time systems symposium, pp 73–83

  • López JM, Díaz JL, García FD (2004) Utilization bounds for EDF scheduling on real-time multiprocessor systems. J Real-Time Syst 28(1):39–68

    Article  MATH  Google Scholar 

  • Parekh A, Gallager R (1993) A generalized processor sharing approach to flow control—the single node case. IEEE/ACM Trans Netw 1(3):344–357

    Article  Google Scholar 

  • Phillips CA, Stein C, Torng E, Wein J (1997) Optimal time-critical scheduling via resource augmentation. In: Proceedings of the ACM symposium on theory of computing, pp. 140–149

  • Rajkumar R, Sha L, Lehoczky JP (1988) Real-time synchronization protocols for multiprocessors. In: Proceedings of IEEE real-time systems symposium, pp 259–269

Download references

Author information

Authors and Affiliations

  1. CISTER/IPP-HURRAY, Polytechnic Institute of Porto, Porto, Portugal

    Björn Andersson & Arvind Easwaran

Authors
  1. Björn Andersson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arvind Easwaran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Arvind Easwaran.

Additional information

This work was funded by the Portuguese Science and Technology Foundation (FCT), the European Commission (ARTISTDesign), the ARTEMIS-JU (RECOMP), and the Luso-American Development Foundation (FLAD).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andersson, B., Easwaran, A. Provably good multiprocessor scheduling with resource sharing. Real-Time Syst 46, 153–159 (2010). https://doi.org/10.1007/s11241-010-9105-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-010-9105-6

Keywords

Search

Navigation