Publications:Minimum EDF-feasible deadline calculation with low-time complexity
From CERES
| Title | Minimum EDF-feasible deadline calculation with low-time complexity |
|---|---|
| Author | Hoai Hoang and Stefan Karlsson and Magnus Jonsson |
| Year | 2004 |
| PublicationType | Conference Paper |
| Journal | |
| HostPublication | RTSS 2004 WIP Proceedings, The 25th IEEE International Real-Time Systems Symposium, Lisbon, Portugal, Dec. 5-8, 2004 |
| DOI | |
| Conference | |
| Diva url | http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:239975 |
| Abstract | 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. |
