Capacity Sharing and Stealing in Dynamic Server-based Real-Time Systems

13 years 11 months ago

Download www.cecs.uci.edu

This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efﬁciently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more signiﬁcant when tasks’ computation times have a large variance.

Luís Nogueira, Luís Miguel Pinho

Real-time Traffic