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

Friedrich Eisenbrand, Thomas Rothvoß. EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 1029-1034, SIAM, 2010. [doi]

Abstract

Abstract is missing.