The M-CASH Resource Reclaiming Algorithm for Identical Multiprocessor Platforms

Pellizzoni, Rodolfo; Caccamo, Marco

Permalink

https://hdl.handle.net/2142/11172 Copy

Description

Title

The M-CASH Resource Reclaiming Algorithm for Identical Multiprocessor Platforms

Author(s)

• Pellizzoni, Rodolfo
• Caccamo, Marco

Issue Date

2006-03

Keyword(s)

• algorithms
• computer science

Abstract

Resource reclaiming schemes are 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 algorithm M-CASH, a new efficient reclaiming scheme 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 experimentally evaluated through several synthetic simulations.

Type of Resource

text

Permalink

http://hdl.handle.net/2142/11172

Copyright and License Information

You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the University of Illinois at Urbana-Champaign Computer Science Department under terms that include this permission. All other rights are reserved by the author(s).

Owning Collections