CMU-CS-03-201 Computer Science Department School of Computer Science, Carnegie Mellon University
How Many Servers are Best in a Fual-Priority FCFS System? Takayuki Osogami, Adam Wierman, Mor Harchol-Balter, Alan Scheller-Wolf* November 2003
CMU-CS-03-201.ps
This paper is the first to analyze an M/GI/k system with two priority classes and a general phase-type distribution. Prior analyses of the M/GI/k with two priority classes either require that G be exponential, or are approximations that work well when G is exponential, but are less reliable for more variable G. Our analytical method is very different from the prior literature: it combines the technique of dimensionality reduction with Neuts' technique for determining busy periods in multiserver systems. Our analysis is approximate, but can be made as accurate as desired, and is verified via simulation. 16 pages *Carnegie Mellon University, Graduate School of Industrial Administration | |
Return to:
SCS Technical Report Collection This page maintained by reports@cs.cmu.edu |