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

Friedrich Eisenbrand, Thomas Rothvoß (2008)

Details and statistics

DOI: 10.1109/RTSS.2008.25

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

a service of  Schloss Dagstuhl - Leibniz Center for Informatics