An Adaptive-Priority Queue
Priority scheduling is used frequently in computer systems; however, such schedules usually have a “fail-safe” provision to prevent high-priority requests from causing unlimited delay to low-priority ones. In this paper, a queue and server is considered which has two sources of Poisson-arrival customers, types a and b respectively. Non-preemptive priority is granted to type a customers, except that whenever the number of waiting type b customers exceeds a specified threshold, class b receives priority. Service times are assumed exponentially distributed with a common mean, but it is possible to greatly relax this restriction. The intent is to grant priority to class a most of the time, while bounding the mean waiting time of class b customers under heavy class a load. This particular fail-safe mechanism is shown to have the property that for system states in which class b is below the threshold, the occupancy probability is exactly the same as if class a always had high priority.
KeywordsService Time Queue Length Busy Period Priority Schedule State Transition Diagram
Unable to display preview. Download preview PDF.
- Badr, H. G. and J. R. Spirn, “An Adaptive-Priority Queue,” The Pennsylvania State University Computer Science Technical Report CS-79-38.Google Scholar
- Badr, H. G. and J. R. Spirn, “An M/G/1 Adaptive-Priority Queue,” to appear.Google Scholar
- Chattergy, R. and W. W. Lichtenberger, “BCC 500: A Distributed Function Multiprocessor System,” University of Hawaii Electrical Engineering Technical Report, 1978.Google Scholar
- Cohen, J. W., The Single Serve Queue, North Holland (Amsterdam), 1969.Google Scholar
- Coffman, E. G., and P. J. Denning, Operating Systems Theory, Prentice Hall, Englewood Cliffs, NJ, 1973.Google Scholar
- Conway, R. L., W. L. Maxwell, and L. W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass., 1967.Google Scholar
- Gross, D., and C. M. Harris, Fundamentals of Queueing Theory, Wiley-Applied Statistics, New York, 1974.Google Scholar
- Kleinrock, L., Queueing Systems, Vol. I: Theory, Wiley-Interscience, New York, 1975.Google Scholar
- Kleinrock, L., Queueing Systems, Vol. II: Computer Applications, Wiley-Interscience, New York, 1975.Google Scholar