The Response Times of Priority Classes under Preemptive Resume in M / M / m Queues

J. P. Buzen and A. B. Bondi
Additional contact information
J. P. Buzen: BGS Systems, Inc., Waltham, Massachusetts
A. B. Bondi: Purdue University, West Lafayette, Indiana

Operations Research, 1983, vol. 31, issue 3, 456-465

Abstract: Expressions are derived for the mean response times of each priority level in a multiserver M / M / m queue operating under preemptive resume scheduling. Exact results are obtained for cases where all priorities have the same mean service times; approximate results are obtained for the more general case where mean service times may differ. The results hold for any number of servers and any number of classes. For each priority level, it is assumed that arrivals are Poisson and service times are exponentially distributed.

Keywords: 683 approximations for M/M/m priority queues; 693 multichannel queues with preemptive priority; 698 priority queues (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.3.456 (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:31:y:1983:i:3:p:456-465

Access Statistics for this article

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