This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling
October 1990 (vol. 16 no. 10)
pp. 1198-1208

A means of approximating light-traffic performance of RAD (random-arrivals-with-deadlines) systems for four basic preemptive scheduling policies is presented. The design goal is to keep congestion low enough to make the probability of rejection acceptably small. These designs must have low processor utilization. The study analyzes rejection probabilities at utilizations up to 20% and rejection probabilities up to about 10% for various well-known preemptive scheduling disciplines (shortest job first, earliest due date, and least laxity first), as well as first-come, first-served. Good approximations for the rejection probability and for a number of other properties, such as the distribution of time-to-go at rejection, are found.

[1] F. Bacelli, P. Boyer, and G. Hebuterne, "Single server queues with impatient customers,"Advanced Appl. Prob., vol. 16, pp. 887-905, 1984.
[2] M. S. Deutsch, "Focusing real-time systems analysis on user operations,"IEEE Software, vol. 5, no. 5, pp. 39-50, Sept. 1988.
[3] B. Doshi and H. Heffes, "Overload performance of several processor disciplines for the M/M/1 queue,"IEEE Trans. Comput., vol. C-35, pp. 538-546, June 1986.
[4] R. Ford, "Concurrent algorithms for real-time memory management,"IEEE Software, vol. 5, no. 5, pp. 10-23, Sept. 1988.
[5] B. Gavish and P. J. Schweitzer, "The Markovian queue with bounded waiting time,"Management Sci., vol. 23, pp. 1349-1357, 1977.
[6] B. V. Gnedenko and L. N. Kovalenko,Elements of Queueing Theory(Israel Program for Scientific Research), 1968.
[7] L. Kleinrock,Queueing Systems Volume 1: Theory. New York: Wiley Interscience, 1975.
[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] J. F. Kurose, S. Singh, and R. Chipalkatti, "A study of quasi-dynamic load sharing in soft real-time distributed systems," inProc. 7th IEEE Real-Time System Symp., Dec. 1986.
[10] E. D. Jansen, C. D. Locke, and H. Tokuda, "A time-driven scheduling model for real-time operating systems," inIEEE Real-Time Systems Symp., Dec. 1985.
[11] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[12] K. Ramamrithram and J. A. Stankovic, "Dynamic task scheduling in distributed hard real-time systems,"IEEE Software, vol. 1, no. 3, pp. 65-75, 1984.
[13] J. A. Stankovic, "A serious problem for next-generation systems,"Computer, vol. 21, no. 10, pp. 10-19, Oct. 1988.
[14] C. M. Woodside and D. W. Craig, "Local non-preemptive scheduling of hard real-time tasks," inProc. 8th IEEE Real-Time System Symp., Dec. 1987.
[15] C. M. Woodside and D. W. Craig, "Light traffic performance for preemptive scheduling of hard real-time tasks on homogeneous networks," submitted for publication, June 1988.

Index Terms:
rejection rate for tasks; random arrivals; deadlines; preemptive scheduling; RAD; random-arrivals-with-deadlines; rejection probabilities; performance evaluation; queueing theory; real-time systems; scheduling
Citation:
D.W. Craig, C.M. Woodside, "The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling," IEEE Transactions on Software Engineering, vol. 16, no. 10, pp. 1198-1208, Oct. 1990, doi:10.1109/32.60299
Usage of this product signifies your acceptance of the Terms of Use.