| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 387.57 KB | Adobe PDF |
Advisor(s)
Abstract(s)
A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed.
Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing
reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism
ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing
some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the
budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This
paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness
of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.