John P. Lehoczky
ABSTRACT
This paper presents real-time queueing theory, a new theory which embeds the ability of real-time scheduling theory to determine whether task timing requirements are met into the context of queueing models. Specifically, this paper extends the analysis developed in Lehoczky [9] to the GI/M/1 case. The paper also applies these models to study queue control strategies which can control customer lateness. Arriving customers have deadlines drawn from a general deadline distribution. The state variable for the queueing system must include the number in the queue (with supplementary variables as needed to create a Markov model) and the lead-time (deadline minus current time) of each customer; thus the state space is infinite dimensional. One can represent the state of the system as a measure on the real line and can represent that measure by its Fourier transform. Thus, a real-time queueing system can be characterized as a Markov process evolving on the space of Fourier transforms, and this paper presents a characterization of the instantaneous simultaneous lead-time profile of all the customers in the queue. This profile is complicated; however, in the heavy traffic case, a simple description of the lead-time profile emerges, namely that the lead-time profile behaves like a Brownian motion evolving on a particular manifold of Fourier transforms; the manifold depending upon the queue discipline and the customer deadline distributions. This approximation is very accurate when compared with simulations. Real-time queueing theory focuses on how well a particular queue discipline meets customer timing requirements, and focuses on the dynamic rather than the equilibrium behavior of the system. As such, it offers the potential to study control strategies to ensure that customers meet their deadlines. This paper illustrates the analysis and performance evaluation for certain queue control strategies. Generalizations to more complicated models and to queueing networks are discussed.
- 1.Burman, D. Y., "An analytic approach to diffusion approximation in queueing," Ph.D. dissertation, Department of Mathematics, New York University, 1979.Google Scholar
- 2.Dai, J. G., "On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models," Annals of Applied Prob., 5, 1995, 49-77.Google ScholarCross Ref
- 3.Harrison, J. M., Brownian Motion and Stochastic Flow Systems, John Wiley, New York, 1985.Google Scholar
- 4.Harrison, J. M., "Brownian models of queueing networks with heterogeneous customer populations," in Proceedings o} the IMA Workshop on Stochastic Differential Systems," Springer-Verlag, 1988, 147-186.Google Scholar
- 5.Harrison, J. M. and Nguyen, V., "Brownia# models of multiclass queueing networks: Current status and open problems," Queueing Sys. Th. Appl., 13, 1993, 5-40.Google ScholarCross Ref
- 6.Harrison, J. M. and Wein, L. J., "Scheduling networks of queues: Heavy traffic analysis of a two-station closed network," Op. Res., 38, 1990, 1052-1064. Google ScholarDigital Library
- 7.Hong, J., Tan, X. and Towsley, D., "A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system," IEEE Trans. on Computers, 1989, 1736-1744. Google ScholarDigital Library
- 8.Klein, M., Ralya, T., Pollak, B., Obenza, R. and Gonzalez Harbour, M., A Practitioner's Handbook for Real- Time Analysis, Kluwer, Boston, 1993. Google ScholarDigital Library
- 9.Lehoczky, J.P., "Real-time queueing theory," Proc. IEEE Real-time Systems Symposium, 1996, 186-195. Google ScholarDigital Library
- 10.Liu, C.L. and Layland, J.W., "Scheduling algorithms for multiprogramming in a hard real-time environment," JACM, 20(1), 1973, 40-61. Google ScholarDigital Library
- 11.Panwax, S., Towsley, D. and Wolf, J., "Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service," JACM, 35, 1988, 832-844. Google ScholarDigital Library
- 12.Wein, L. J., "Scheduling networks of queues: Heavy traffic analysis of a two-station network with controllable inputs," Op. Res., 38, 1990, 1065-1078. Google ScholarDigital Library
Index Terms
- Using real-time queueing theory to control lateness in real-time systems
Recommendations
Using real-time queueing theory to control lateness in real-time systems
This paper presents real-time queueing theory, a new theory which embeds the ability of real-time scheduling theory to determine whether task timing requirements are met into the context of queueing models. Specifically, this paper extends the analysis ...
A discrete-time queueing model with abandonments
QTNA '10: Proceedings of the 5th International Conference on Queueing Theory and Network ApplicationsThis paper presents a multi-server queueing model with abandonments in discrete time. In every time slot a generally distributed number (batch) of customers arrives. The different numbers of arrivals in consecutive slots are mutually independent. Each ...
Feedback Queueing Models for Time-Shared Systems
Time-shared processing systems (e.g. communication or computer systems) are studied by considering priority disciplines operating in a stochastic queueing environment. Results are obtained for the average time spent in the system, conditioned on the ...
Comments