Capacity Sharing and Stealing in Dynamic Server-based Real-Time Systems
Ref: HURRAY-TR-070201 Publication Date: 26 to 30, Mar, 2007
Capacity Sharing and Stealing in Dynamic Server-based Real-Time SystemsRef: HURRAY-TR-070201 Publication Date: 26 to 30, Mar, 2007
This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently 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 significant when tasks’ computation times have a large variance.
21st IEEE International Parallel & Distributed Processing Symposium (IPDPS 2007), IEEE, pp 1-8.
Long Beach, U.S.A..