OPSEARCH

, Volume 37, Issue 3, pp 252–258 | Cite as

Heavy Traffic Response Times for a Priority Queue with Non-linear Priorities

  • S. S. Mishra
Technical Note
First Online:
  • 3 Downloads

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.

Key words

Heavy traffic Priority queue Non-linear priorities 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Bagchi U and Sullivan R. “Dynamie. non-preemptive priority queues with general. linearly increasing priority functions”. Opns.Res. 33 (1985) 1278–1298.CrossRefGoogle Scholar
  2. [2]
    Cobhan A. “Priority assignment in waiting line problems”. Opns.Res. 2 (1954) 70–76.Google Scholar
  3. [3]
    Franaszek P and Nelson R. “Delay cost scheduling for timesharing systems”. IBM Research Report (1988) RC 13777.Google Scholar
  4. [4]
    IBM. “Virtual mechanic/ system product high performance option”. Program Number 5664-173 (1983) 5664–167.Google Scholar
  5. [5]
    Jackson J. R. “Some problems in queueing with dynamic priorities”. Naval Res. Logist. Quart. 7 (1960) 235–249.CrossRefGoogle Scholar
  6. [6]
    Jackson J. R. “Queues with dynamic priorities”. Mgmt.Sci. 1,(1961) 18–34.CrossRefGoogle Scholar
  7. [7]
    Jackson J. R. “ Waiting time distributions for queues with dynamic priorities”. Naval Res. Logist. Quart. 9 (1962) 31–36.CrossRefGoogle Scholar
  8. [8]
    Kingman J. F. C. “Inequalities in the theory of queues”. J. Royal Statist. Soc. Series B 32 (1970) 102–110.Google Scholar
  9. [9]
    Kleinrock L. “A delay dependent queue discipline”. Naval Res. Logist. Quart. 11 (1964) 329–341.CrossRefGoogle Scholar
  10. [10]
    Kleinrock L. “A conservation law for a wide class of queueing discipline”. Naval Res. Logist. Quart. 12 (1965) 181–192.CrossRefGoogle Scholar
  11. [11]
    Kleinrock L. “ Queueing system”. Vol. 2, Computer Applications, John Wiley, New York (1975).Google Scholar
  12. [12]
    Kleinrock L and R. P. “Time dependent priority queues”. Opns. Res. 15 (1967) 104–116.CrossRefGoogle Scholar
  13. [13]
    Nelson R. “Heavy traffic response times for a priority queue with linear priorities”. IBM Research Report, (1987) RC 13049.Google Scholar
  14. [14]
    Nelson R. “Heavy traffic response times for a priority queue with linear priorities”. Opns. Res. Vol. 38, No. 3 (1990) 560–563.CrossRefGoogle Scholar
  15. [15]
    Netterman A and Adiri I. “A dynamic priority queue with general concave priority functions”. Opns. Res. 27 (1979) 1088–1100.CrossRefGoogle Scholar

Copyright information

© Operational Research Society of India 2000

Authors and Affiliations

  • S. S. Mishra
    • 1
  1. 1.Dept of Mathematics and StatisticsDr. R. M. L. Avadh UniversityFaizabadIndia

Personalised recommendations