Abstract
Previous work concentrated on providing heavy traffic response times for priority queue with linear priorities. Present paper analyses a priority queue with nonlinear priorities. In the present work, we consider queueing system consisting of a single server, which dispenses service to jobs of K ≥ 1 priority classes. Jobs are assumed to arrive to the queue according to a Poisson point process with a class dependent rate and to have class dependent service demands that are generally distributed. A non-linear priority function of the time spent in the system is specified for each job class and is used to schedule jobs. We provide closed form expressions for the mean class response time under heavy traffic and light load conditions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bagchi U and Sullivan R. “Dynamie. non-preemptive priority queues with general. linearly increasing priority functions”. Opns.Res. 33 (1985) 1278–1298.
Cobhan A. “Priority assignment in waiting line problems”. Opns.Res. 2 (1954) 70–76.
Franaszek P and Nelson R. “Delay cost scheduling for timesharing systems”. IBM Research Report (1988) RC 13777.
IBM. “Virtual mechanic/ system product high performance option”. Program Number 5664-173 (1983) 5664–167.
Jackson J. R. “Some problems in queueing with dynamic priorities”. Naval Res. Logist. Quart. 7 (1960) 235–249.
Jackson J. R. “Queues with dynamic priorities”. Mgmt.Sci. 1,(1961) 18–34.
Jackson J. R. “ Waiting time distributions for queues with dynamic priorities”. Naval Res. Logist. Quart. 9 (1962) 31–36.
Kingman J. F. C. “Inequalities in the theory of queues”. J. Royal Statist. Soc. Series B 32 (1970) 102–110.
Kleinrock L. “A delay dependent queue discipline”. Naval Res. Logist. Quart. 11 (1964) 329–341.
Kleinrock L. “A conservation law for a wide class of queueing discipline”. Naval Res. Logist. Quart. 12 (1965) 181–192.
Kleinrock L. “ Queueing system”. Vol. 2, Computer Applications, John Wiley, New York (1975).
Kleinrock L and R. P. “Time dependent priority queues”. Opns. Res. 15 (1967) 104–116.
Nelson R. “Heavy traffic response times for a priority queue with linear priorities”. IBM Research Report, (1987) RC 13049.
Nelson R. “Heavy traffic response times for a priority queue with linear priorities”. Opns. Res. Vol. 38, No. 3 (1990) 560–563.
Netterman A and Adiri I. “A dynamic priority queue with general concave priority functions”. Opns. Res. 27 (1979) 1088–1100.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mishra, S.S. Heavy Traffic Response Times for a Priority Queue with Non-linear Priorities. OPSEARCH 37, 252–258 (2000). https://doi.org/10.1007/BF03398616
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03398616