This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
December 1989 (vol. 38 no. 12)
pp. 1736-1744
A study is made of the performance of a real-time system in which jobs all have deadlines for either the beginning or the end of service. In the first case the authors analyze the minimum laxity (ML) scheduling policy when there are c processors, and in the latter case they analyze the preemptive-resume earliest deadline (ED) scheduling policy when there is one server. In both cases, the analys

[1] F. Baccelli, P. Boyer, and G. Hebuterne, "Single-server queue with impatient customers,"Advances Appl. Prob., vol. 16, pp. 887-905, 1984.
[2] D. Y. Barrer, "Queueing with impatient customers and indifferent clerks,Oper. Res., vol. 5, pp. 644-649, 1957.
[3] D. Y. Barrer, "Queueing with impatient customers and ordered service,"Oper. Res., vol. 5, pp. 650-656, 1957.
[4] J. W. Cohen, "Single server queues with restricted accessibility,"J. Eng. Math, vol. 3, pp. 265-284, Oct. 1969.
[5] B. Gavish and P. Schweitzer, "The Markovian queue with bounded waiting time,"Management Sci., vol. 23, no. 12, pp. 1349-1357, Aug. 1977.
[6] R. Haugen and E. Skogan, "Queueing systems with stochastic time out,"IEEE Trans. Commun., vol. 28, no. 12, 1980.
[7] J. Hong, X. Tan, and D. Towsley, "The binary simulation of the minimum laxity and earliest deadline scheduling policies for real-time systems," COINS Tech. Rep. 89-70, Dep. Comput. Inform. Sci., Univ. of Massachusetts, July 1989.
[8] J. F. Kurose and R. Chipalkatti, "Load sharing in soft real-time distributed computer systems,"IEEE Trans. Comput., vol. C-36, pp. 993-1000, Aug. 1987.
[9] S. Panwar, D. Towsley, and J. Wolf, "Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service,"J. ACM, vol. 35, no. 4, Oct. 1988.
[10] S. Panwar and D. Towsley, "On the optimality of the STE rule for multiple server queues that serve customers with deadlines," COINS Tech. Rep. 88-81, 1988.
[11] R. E. Stanford, "Reneging phenomena in single channel queues,"Math. Oper. Res., vol. 4, no. 2, pp. 162-178, May 1979.
[12] J.A. Stankovic and K. Ramamritham,Hard Real-Time Systems, CS Press, Los Alamitos, Calif., 1984.
[13] D. Stoyan,Comparison Methods for Queues and Other Stochastic Models. New York: Wiley, 1983.
[14] W. Zhao and J. A. Stankovic, "Performance evaluation of FCFS and improved FCFS scheduling for dynamic real-time computer systems," inProc. 10th Real-Time Syst. Symp., Santa Monica, CA, Dec. 5-7, 1989, pp. 156-165.

Index Terms:
performance analysis; minimum laxity; deadline scheduling; performance; real-time system; scheduling policy; Poisson arrival process; exponential service times; performance evaluation; real-time systems; scheduling.
Citation:
J. Hong, X. Tan, D. Towsley, "A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System," IEEE Transactions on Computers, vol. 38, no. 12, pp. 1736-1744, Dec. 1989, doi:10.1109/12.40851
Usage of this product signifies your acceptance of the Terms of Use.