Skip to main content
SpringerLink
Log in

M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms

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

Abstract

Resource reclaiming schemes are typically applied in reservation-based real-time uniprocessor systems to support efficient reclaiming and sharing of computational resources left unused by early completing tasks, improving the response times of aperiodic and soft tasks in the presence of overruns. In this paper, we introduce a novel and efficient reclaiming algorithm, named M-CASH, for multiprocessor platforms. M-CASH leverages the resource reservation approach offered by the Multiprocessor CBS server offering significant improvements. The correctness of the algorithm is formally proven and its performance is evaluated through extensive synthetic simulations.

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

  • Abeni L (1998) Server mechanisms for multimedia applications. Technical report RETIS TR98-01, Scuola Superiore Sant’ Anna

  • Abeni L, Buttazzo G (1998) Integrating multimedia applications in hard real-time systems. In: Proc. of the 19th IEEE RTSS, Madrid, Spain, December 1998

  • Andersson B, Jonsson J (2002) Preemptive multiprocessor scheduling anomalies. In: International parallel and distributed processing symposium

  • Bartolini C, Lipari G (2005) Real-time system SIMulator (RTSIM), Scuola Superiore Sant’Anna. http://rtsim.sssup.it/

  • Baruah S (2004) Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans Comput 53(6):781–784

    Article  Google Scholar 

  • Baruah S, Fisher N (2005) The partitioned multiprocessor scheduling of sporadic task systems. In: Proc. of the 26th IEEE RTSS, Miami, Florida

  • Baruah SK, Cohen NK, Plaxton CG, Varvel DA (1996) Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15(6):600–625

    MATH  MathSciNet  Google Scholar 

  • Baruah S, Goossens J, Lipari G (2002) Implementing constant-bandwidth servers upon multiprocessor platforms. In: Proc. of 8th IEEE RTAS

  • Bertogna M, Cirinei M, Lipari G (2002) Improved schedulability analysis of EDF on multiprocessor platforms. In: IEEE proc. of 17th ECRTS, pp 209–218

  • Caccamo M, Buttazzo G, Sha L (2000) Capacity sharing for overrun control. In: Proceedings of the IEEE real-time systems symposium, Orlando, Florida, December 2000

  • Caccamo M, Buttazzo G, Thomas D (2005) Efficient reclaiming in reservation-based real-time systems with variable execution times. IEEE Trans Comput 54(2):198–213

    Article  Google Scholar 

  • Cho S, Lee S, Ahn S, Lin K (2002) Efficient real-time scheduling algorithms for multiprocessor systems. IEICE Trans Commun E85-B(12):2859–2867

    Google Scholar 

  • Dhall SK, Liu CL (1978) On a real-time scheduling problem. Oper Res 26(1):127–140

    Article  MATH  MathSciNet  Google Scholar 

  • Gai P, Lipari G, Di Natale M (2001) Minimizing memory utilization of real-time task sets in single multi-processor systems-on-a-chip. In: Proc. of the 22th IEEE RTSS

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

    Article  MATH  Google Scholar 

  • Knuth DE (1998) The art of computer programming. Addison-Wesley, Reading

    Google Scholar 

  • Lin C, Brandt SA (2005) Improving soft real-time performance through better slack reclaiming. In: Proceedings of the 26th IEEE real-time system symposium

  • Lipari G, Baruah S (2000) Greedy reclamation of unused bandwidth in constant-bandwidth servers. In: IEEE proc. of 12th ECRTS

  • Marzario L, Lipari G, Balbastre P, Crespo A (2004) Iris: a new reclaiming algorithm for server-based real-time systems. In: Proc. of the 10th IEEE RTAS

  • Rajkumar R (1991) Synchronization in multiple processor systems. In: Synchronization in real-time systems: a priority inheritance approach. Kluwer Academic, Dordrecht

    Google Scholar 

  • Spuri M, Buttazzo GC, Sensini F (1995) Robust aperiodic scheduling under dynamic priority systems. In: Proceedings of the IEEE real-time systems symposium, December 1995

  • Srinivasan A, Baruah S (2004) Deadline-based scheduling of periodic task systems on multiprocessors. Inf Process Lett 84(2):93–98

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Illinois at Urbana-Champaign, 201 N Goodwin Ave, Urbana, IL, 61801, USA

    Rodolfo Pellizzoni & Marco Caccamo

Authors
  1. Rodolfo Pellizzoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Caccamo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rodolfo Pellizzoni.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pellizzoni, R., Caccamo, M. M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms. Real-Time Syst 40, 117–147 (2008). https://doi.org/10.1007/s11241-008-9051-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-008-9051-8

Keywords

Search

Navigation