Abstract
The authors consider a model comprising several servers, with possibly different services speeds, each equipped with its own queue. Each server receives a dedicated arrival stream of jobs; there is also a stream of generic jobs that arrive at a job scheduler and can be individually allocated to any of the servers. It is shown that if the arrival streams are all Poisson, and all jobs have the same exponentially distributed service requirements, then the probabilistic splitting of the generic stream that minimizes the average job response time is one that balances the server idle times in a weighted least squares sense, where the weighting coefficients are related to the service speeds of the servers. The corresponding result holds for nonexponentially distributed service times, if the service speeds are all equal. >
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
