A blind policy for equalizing cumulative idleness.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 60644213 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A blind policy for equalizing cumulative idleness. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Atar%2C+Rami%22">Atar, Rami</searchLink><relatesTo>1</relatesTo><i> atar@ee.technion.ac.il</i><br /><searchLink fieldCode="AR" term="%22Shaki%2C+Yair+Y%2E%22">Shaki, Yair Y.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Shwartz%2C+Adam%22">Shwartz, Adam</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Queueing+Systems%22">Queueing Systems</searchLink>. Apr2011, Vol. 67 Issue 4, p275-293. 19p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Queueing+networks%22">Queueing networks</searchLink><br /><searchLink fieldCode="DE" term="%22Structured+techniques+of+electronic+data+processing%22">Structured techniques of electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+operating+systems%22">Computer operating systems</searchLink><br /><searchLink fieldCode="DE" term="%22Internet+servers%22">Internet servers</searchLink><br /><searchLink fieldCode="DE" term="%22Large+scale+systems%22">Large scale systems</searchLink><br /><searchLink fieldCode="DE" term="%22Error+functions%22">Error functions</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>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.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=60644213 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s11134-011-9212-7 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 19 StartPage: 275 Subjects: – SubjectFull: Queueing networks Type: general – SubjectFull: Structured techniques of electronic data processing Type: general – SubjectFull: Computer operating systems Type: general – SubjectFull: Internet servers Type: general – SubjectFull: Large scale systems Type: general – SubjectFull: Error functions Type: general Titles: – TitleFull: A blind policy for equalizing cumulative idleness. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Atar, Rami – PersonEntity: Name: NameFull: Shaki, Yair Y. – PersonEntity: Name: NameFull: Shwartz, Adam IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2011 Type: published Y: 2011 Identifiers: – Type: issn-print Value: 02570130 Numbering: – Type: volume Value: 67 – Type: issue Value: 4 Titles: – TitleFull: Queueing Systems Type: main |
| ResultId | 1 |
