On the Average Complexity of the Processor Demand Analysis for Earliest Deadline Scheduling
暂无分享,去创建一个
[1] Laurent George,et al. Characterization of the Space of Feasible Worst-Case Execution Times for Earliest-Deadline-First Scheduling , 2009, J. Aerosp. Comput. Inf. Commun..
[2] Sanjoy K. Baruah,et al. Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.
[3] Alan Burns,et al. Schedulability Analysis for Real-Time Systems with EDF Scheduling , 2009, IEEE Transactions on Computers.
[4] Sanjoy K. Baruah,et al. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.