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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 117-147 |
| Number of pages | 31 |
| Journal | Real-Time Systems |
| Volume | 40 |
| Issue number | 1 |
| DOIs | |
| State | Published - Oct 2008 |
| Externally published | Yes |
Keywords
- Real-time resource reservation
- Real-time scheduling
- Symmetric multiprocessors
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Computer Science Applications
- Computer Networks and Communications
- Control and Optimization
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS