Uniprocessor Feasibility of Sporadic Tasks Remains coNP-Complete under Bounded Utilization
暂无分享,去创建一个
[1] Sanjoy K. Baruah,et al. Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[2] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[3] Sanjoy K. Baruah,et al. Open problems in real-time scheduling , 2010, J. Sched..
[4] Friedrich Eisenbrand,et al. EDF-schedulability of synchronous periodic task systems is coNP-hard , 2010, SODA '10.
[5] Wang Yi,et al. Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines Is Strongly coNP-Complete , 2015, 2015 27th Euromicro Conference on Real-Time Systems.
[6] Michael L. Dertouzos,et al. Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.
[7] Sanjoy K. Baruah,et al. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.
[8] J. Leung,et al. A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..