The Community for Technology Leaders
Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004. (2004)
Toronto, Canada
May 25, 2004 to May 28, 2004
ISSN: 1080-1812
ISBN: 0-7695-2148-7
pp: 211
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
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.
INDEX TERMS
null
CITATION

A. Crespo, G. Lipari, L. Marzario and P. Balbastre, "IRIS: A New Reclaiming Algorithm for Server-Based Real-Time Systems," Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.(RTAS), Toronto, Canada, 2004, pp. 211.
doi:10.1109/RTTAS.2004.1317266
94 ms
(Ver 3.3 (11022016))