Bibliographic Details
| Title: |
A blind policy for equalizing cumulative idleness. |
| Authors: |
Atar, Rami1 atar@ee.technion.ac.il, Shaki, Yair Y.1, Shwartz, Adam1 |
| Source: |
Queueing Systems. Apr2011, Vol. 67 Issue 4, p275-293. 19p. |
| Subjects: |
Queueing networks, Structured techniques of electronic data processing, Computer operating systems, Internet servers, Large scale systems, Error functions |
| Abstract: |
We consider a system with a single queue and multiple server pools of heterogeneous exponential servers. The system operates under a policy that always routes a job to the pool with longest cumulative idleness among pools with available servers, in an attempt to achieve fairness toward servers. It is easy to find examples of a system with a fixed number of servers, for which fairness is not achieved by this policy in any reasonable sense. Our main result shows that in the many-server regime of Halfin and Whitt, the policy does attain equalization of cumulative idleness, and that the equalization time, defined within any given precision level, remains bounded in the limit. An important feature of this policy is that it acts 'blindly', in that it requires no information on the service or arrival rates. [ABSTRACT FROM AUTHOR] |
|
Copyright of Queueing Systems is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
