Selecting the Minimum Consumed Bandwidth of an EDF Task Set
Enrico Bini, Buttazzo Giorgio, Yifan Wu · CINECA IRIS Institutional Research Information System (Sant'Anna School of Advanced Studies) · 2009
The usage of virtual processor is a key aspect for isolating real-time applications. A typical interface of virt ual processor is expressed by the bandwidth and the delay. After formulating the overall consumed bandwidth as a function of the bandwidth and the delay that accounts also for the context switches, we proposed an algorithm that find the least consuming interface that is capable to guarantee the deadlines of a set of tasks scheduled by EDF. The proposed algorithm is inspired by the dual simplex algorithm.