Reducing Delay in Preemptive Repeat Priority Queues

References

• Adiri I., Domb I. A single server queueing system working under mixed priority disciplines. Oper. Res. (1982) 30:97–115Link, Google Scholar
• Adiri I., Domb I. Mixing of nonpreemptive and preemptive repeat priority disciplines. Euro. J. Oper. Res. (1984) 18:86–97Crossref, Google Scholar
• Baccelli F., Coffman E. G. A data base replication analysis using an M/M/m queue with service interruptions. SIGMETRICS Perf. Eval. Rev. (1982) 11:102–107Crossref, Google Scholar
• Baker T. P. Stack-based scheduling of realtime processes. Real-Time Syst. (1991) 3:67–99Crossref, Google Scholar
• Chang W. Preemptive priority queues. Oper. Res. (1965) 13:820–827Link, Google Scholar
• Coffman E. G., Gelenbe E., Plateau B. Optimization of the number of copies in a distributed data base. IEEE Trans. Software Engrg. (1981) SE-7:78–84Crossref, Google Scholar
• Conway R. W., Maxwell W., Miller L.Theory of Scheduling (1967) (Addison-Wesley, Reading, MA) Google Scholar
• Drekic S., Stanford D. A. Reducing delay in preemptive priority queues. (1998) . Technical Report 98-01. Department of Statistical and Actuarial Sciences, The University of Western Ontario, London, OntarioGoogle Scholar
• Drekic S., Stanford D. A. Threshold-based interventions to optimize performance in preemptive priority queues. Queueing Syst. (2000) 35:289–315Crossref, Google Scholar
• Gail H. R., Hantler S. L., Taylor B. A., Hasegawa T., Takagi H., Takahashi Y. Partial preemption in a system with two processors. Performance of Distributed and Parallel Systems (1989) (North-Holland, Amsterdam, The Netherlands) 209–224Google Scholar
• Jaiswal N. K.Priority Queues (1968) (Academic Press, New York) Google Scholar
• Kesten H., Runnenburg J. T. Priority in waiting line problems, I and II. Proc. Koninkl. Nederlandse Akademie van Wetenschappen, Series A (1957) 60:312–324325336Google Scholar
• Kulkarni V. G., Nicola V. F., Trivedi K. S. The completion time of a job on multimode systems. Advances in Appl. Probab. (1987) 19:932–954Crossref, Google Scholar
• Leung J. Y. T., Whitehead J. On the complexity of fixed-priority scheduling of periodic real-time tasks. Performance Evaluation (1982) 2:237–250Crossref, Google Scholar
• Liu C. L., Layland J. W. Scheduling algorithms for multiprogramming in a hard-real-time environment. JACM (1973) 20:46–61Crossref, Google Scholar
• Nicola V. F., Kulkarni V. G., Trivedi K. S. Queueing analysis of fault-tolerant computer systems. IEEE Trans. Software Engrg. (1987) SE-13:363–375Crossref, Google Scholar
• Paterok M., Ettl A. Sojourn time and waiting time distributions for M/G/1 queues with preemption-distance priorities. Oper. Res. (1994) 42:1146–1161Link, Google Scholar
• Schrage L. A mixed priority queue with applications to the analysis of real-time systems. (1968) . Report 6819. Center for Mathematical Studies in Business and Economics, University of Chicago, Chicago, ILGoogle Scholar
• Stanford D. A. Waiting and interdeparture times in priority queues with Poisson- and general-arrival streams. Oper. Res. (1997) 45:725–735Link, Google Scholar
• Sumita U., Liu Sheng O. R. Analysis of query processing in distributed database systems with fully replicated files: a hierarchical approach. Performance Evaluation (1988) 8:223–238Crossref, Google Scholar
• Takagi H.Queueing Analysis: A Foundation of Performance Evaluation Volume 1: Vacation and Priority Systems, Part 1 (1991) (North-Holland, Amsterdam, The Netherlands) Google Scholar
• Takagi H., Kodera Y. Analysis of preemptive loss priority queues with preemption distance. Queueing Syst. (1996) 22:367–381Crossref, Google Scholar
• Wolff R. W.Stochastic Modeling and The Theory of Queues (1989) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar