Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard

Friedrich Eisenbrand, Thomas Rothvoß. Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard. In Proceedings of the 29th IEEE Real-Time Systems Symposium, RTSS 2008, Barcelona, Spain, 30 November - 3 December 2008. pages 397-406, IEEE Computer Society, 2008. [doi]

Abstract

Abstract is missing.