Main page Research activities Publications Talks MSc thesis projects Hobby and spare time Write me This site uses
Google Analytics
Last updated on
28 November 2017

Publication details

D. Casini, L. Abeni, A. Biondi, T. Cucinotta, G. Buttazzo. "Constant Bandwidth Servers with Constrained Deadlines," (to appear in) in Proceedings of the 25th International Conference on Real-Time Networks and Systems (RTNS 2017), October 4-6, 2017, Grenoble, France.

Abstract

The Hard Constant Bandwidth Server (H-CBS) is a reservation-based scheduling algorithm often used to mix hard and soft real-time tasks on the same system. A number of variants of the H-CBS algorithm have been proposed in the last years, but all of them have been conceived for implicit server deadlines (i.e., equal to the server period). However, recent promising results on semi-partitioned scheduling together with the demand for new functionality claimed by the Linux community, urge the need for a reservation algorithm that is able to work with constrained deadlines. This paper presents three novel H-CBS algorithms that support constrained deadlines. The three algorithms are formally analyzed, and their performance are compared through an extensive set of simulations.

Download paper

See paper on publisher's website


Main page Research activities Publications Talks MSc thesis projects Hobby and spare time Write me Last updated on