Hardness Results for Static Priority Real-Time Scheduling
暂无分享,去创建一个
[1] Wang Yi,et al. On the Tractability of Digraph-Based Task Models , 2011, 2011 23rd Euromicro Conference on Real-Time Systems.
[2] Mathai Joseph,et al. Finding Response Times in a Real-Time System , 1986, Comput. J..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Wang Yi,et al. The Digraph Real-Time Task Model , 2011, 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium.
[5] Lothar Thiele,et al. On the Complexity of Scheduling Conditional Real-Time Code , 2001, WADS.
[6] Sanjoy K. Baruah,et al. Feasibility analysis of recurring branching tasks , 1998, Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168).
[7] Alan Burns,et al. Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks , 2008, ICTAC.
[8] Areej Zuhily. Exact Response Time Analysis for Multiframe Tasks , 2006 .
[9] James W. Layland,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[10] Sanjoy K. Baruah,et al. Generalized Multiframe Tasks , 1999, Real-Time Systems.
[11] Hiroaki Takada,et al. Schedulability of generalized multiframe task sets under static priority assignment , 1997, Proceedings Fourth International Workshop on Real-Time Computing Systems and Applications.