Design and Analysis of Processor Scheduling Policies for Real-Time Systems
暂无分享,去创建一个
[1] Henry M. Goldberg. Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems , 1977, Math. Oper. Res..
[2] Donald F. Towsley,et al. Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service , 1988, JACM.
[3] Mark S. Boddy,et al. An Analysis of Time-Dependent Planning , 1988, AAAI.
[4] Masayuki Murata,et al. Survey of switching techniques in high-speed networks and their performance , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.
[5] Anthony Ephremides,et al. Optimal scheduling with strict deadlines , 1989 .
[6] Philippe Nain,et al. Properties of the ML(n) policy for scheduling jobs with real-time constraints , 1990, 29th IEEE Conference on Decision and Control.
[7] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.
[8] Mark S. Boddy,et al. Solving Time-Dependent Planning Problems , 1989, IJCAI.
[9] Donald F. Towsley,et al. A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System , 1989, IEEE Trans. Computers.