Minimum EDF-Feasible Deadline Calculation with Low-Time Complexity

We present a method for calculating the minimum EDF-feasible deadline. The algorithm targets periodic tasks with hard real-time guarantees, that are to be feasibly scheduled with EDF (Earliest Deadline First). The output is the smallest possible deadline required for feasibility, of the task most recently requested. The good thing with our algorithm is that it has the same timecomplexity as the regular EDF feasibility test, when deadlines are not assumed to be equal to the periods of the periodic tasks.

[1]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[2]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[3]  Hoai Hoang,et al.  Switched real-time Ethernet in industrial applications - deadline partitioning , 2003, 9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732).