EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard

@inproceedings{Eisenbrand2010EDFschedulabilityOS,
  title={EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard},
  author={Friedrich Eisenbrand and Thomas Rothvo\ss},
  booktitle={SODA},
  year={2010}
}
In the <i>synchronous periodic task model</i>, a set τ<sub>1</sub>, ..., τ<sub><i>n</i></sub> of tasks is given, each releasing jobs of running time <i>c</i><sub><i>i</i></sub> with relative deadline <i>d</i><sub><i>i</i></sub>, at each integer multiple of the period <i>p</i><sub><i>i</i></sub>. It is a classical result that <i>Earliest Deadline First (EDF… CONTINUE READING

1 Figure or Table

Topics

Statistics

05101520082009201020112012201320142015201620172018
Citations per Year

63 Citations

Semantic Scholar estimates that this publication has 63 citations based on the available data.

See our FAQ for additional information.