M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms |
| |
| Authors: | Rodolfo Pellizzoni Marco Caccamo |
| |
| Affiliation: | (1) Department of Computer Science, University of Illinois at Urbana-Champaign, 201 N Goodwin Ave, Urbana, IL 61801, USA |
| |
| 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. |
| |
| Keywords: | Real-time scheduling Symmetric multiprocessors Real-time resource reservation |
| 本文献已被 SpringerLink 等数据库收录！ |
|
