Abstract
We study a Multiserver Job Queuing Model (MJQM), i.e., a FIFO (First-In-First-Out) queue in which jobs request varying numbers of servers. Our investigation focuses on the saturation analysis of MJQM with two job classes. Jobs in the first class need only one server for an exponentially distributed service time, while jobs in the second class require either all servers or a fraction of them. We provide exact results for the scenario in which jobs in the second class require all servers and have generally distributed service times. Additionally, we develop an accurate approximate model of the MJQM behavior when jobs in the second class require a fraction of the available servers, and have exponentially distributed service times.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
