Heavy Traffic Response Times for a Priority Queue with Linear Priorities

Randolph D. Nelson
Additional contact information
Randolph D. Nelson: IBM Thomas J. Watson Research Center, Yorktown Heights, New York

Operations Research, 1990, vol. 38, issue 3, 560-563

Abstract: This paper analyzes a 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 linear priority function of the time spent in the system is specified for each job class and is used to schedule jobs. Specifically, the server, when available for service, nonpreemptively selects the job having the highest priority value to be the next job scheduled. Previous work in analyzing a system of this type has concentrated on providing bounds on the expected class response time. We extend these results by providing a closed form expression for the mean class response time and an expression for the ratio of expected response times in the limiting case of heavy traffic. We also provide a closed form expression for the mean class response time under certain light load conditions.

Keywords: queues; limit theorems: heavy traffic response times; queues; priority: linear priority times (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.3.560 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:3:p:560-563

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().