Rate-Monotonic Schedulability of Implicit-Deadline Tasks is NP-hard Beyond Liu and Layland's Bound.

Pontus Ekberg

Browse the full RTSS paper archive.