Published Articles >> Table of Contents >> Abstract

10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'04)   p. 211
IRIS: A New Reclaiming Algorithm for Server-Based Real-Time Systems
Luca Marzario, Scuola Sup. S. Anna, Pisa, Italy
Giuseppe Lipari, Scuola Sup. S. Anna, Pisa, Italy
Patricia Balbastre, Universidad Politecnica de Valencia, Spain
Alfons Crespo, Universidad Politecnica de Valencia, Spain

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTTAS.2004.1317266
Send link to a friend

Abstract
In this paper we present a new algorithm for CPU resource reservation in real-time systems that allows the coexistence of hard, soft and non real-time tasks. The proposed algorithm is specifically designed to handle computational overload. A task that needs more CPU-time than reserved can re-use the spare bandwidth, without interfering with the others tasks. With respect to other reclamation schemes, the novelty of the proposed algorithm is that the spare bandwidth is fairly distributed among the needing servers. The effectiveness of the algorithm is demonstrated with an extensive set of experiments. We also propose a methodology to set scheduling parameters depending on the type of the task and on the time constraints needed.
Back to Top Additional Information
Citation:  Luca Marzario, Giuseppe Lipari, Patricia Balbastre, Alfons Crespo, "IRIS: A New Reclaiming Algorithm for Server-Based Real-Time Systems," rtas, p. 211,  10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'04),  2004