CHARACTERISTICS OF FAIRNESS METRICS AND THEIR EFFECT ON PERCEIVED SCHEDULER EFFECTIVENESS.
Saved in:
| Title: | CHARACTERISTICS OF FAIRNESS METRICS AND THEIR EFFECT ON PERCEIVED SCHEDULER EFFECTIVENESS. |
|---|---|
| Authors: | Ngubiri, J.1 ngubiri@cit.mak.ac.ug, van Vliet, M.2 mario@cs.ru.nl |
| Source: | International Journal of Computers & Applications. 2010, Vol. 32 Issue 2, p188-196. 9p. |
| Subjects: | Computer scheduling, Sequential scheduling, Time-sharing computer systems, Computer systems, Computer architecture |
| Abstract: | Parallel job schedulers are mostly evaluated using performance metrics. Deductions however can be misleading due to selective job starvation (unfairness). To choose a better scheduler, therefore, there is a need to compare schedulers for fairness as well. Performance and fairness, however, have mostly been studied independently. We examine characteristics of three approaches to fairness evaluation in parallel job scheduling. We examine how they represent job starvation and other aspects of discrimination. We show that the implied unfairness is not always starvation/discrimination in practice. We use simultaneous consideration of performance and fairness and compare deductions with scheduler effectiveness derived from group-wise performance evaluation. We observe that due to possible misrepresentation of starvation by fairness metrics, schedulers shown as superior may not be so in practice. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Computers & Applications is the property of Taylor & Francis Ltd 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: 51546010 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: CHARACTERISTICS OF FAIRNESS METRICS AND THEIR EFFECT ON PERCEIVED SCHEDULER EFFECTIVENESS. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ngubiri%2C+J%2E%22">Ngubiri, J.</searchLink><relatesTo>1</relatesTo><i> ngubiri@cit.mak.ac.ug</i><br /><searchLink fieldCode="AR" term="%22van+Vliet%2C+M%2E%22">van Vliet, M.</searchLink><relatesTo>2</relatesTo><i> mario@cs.ru.nl</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Computers+%26+Applications%22">International Journal of Computers & Applications</searchLink>. 2010, Vol. 32 Issue 2, p188-196. 9p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+scheduling%22">Computer scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Sequential+scheduling%22">Sequential scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Time-sharing+computer+systems%22">Time-sharing computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+architecture%22">Computer architecture</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Parallel job schedulers are mostly evaluated using performance metrics. Deductions however can be misleading due to selective job starvation (unfairness). To choose a better scheduler, therefore, there is a need to compare schedulers for fairness as well. Performance and fairness, however, have mostly been studied independently. We examine characteristics of three approaches to fairness evaluation in parallel job scheduling. We examine how they represent job starvation and other aspects of discrimination. We show that the implied unfairness is not always starvation/discrimination in practice. We use simultaneous consideration of performance and fairness and compare deductions with scheduler effectiveness derived from group-wise performance evaluation. We observe that due to possible misrepresentation of starvation by fairness metrics, schedulers shown as superior may not be so in practice. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Computers & Applications is the property of Taylor & Francis Ltd 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=51546010 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/1206212X.2010.11441974 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 188 Subjects: – SubjectFull: Computer scheduling Type: general – SubjectFull: Sequential scheduling Type: general – SubjectFull: Time-sharing computer systems Type: general – SubjectFull: Computer systems Type: general – SubjectFull: Computer architecture Type: general Titles: – TitleFull: CHARACTERISTICS OF FAIRNESS METRICS AND THEIR EFFECT ON PERCEIVED SCHEDULER EFFECTIVENESS. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ngubiri, J. – PersonEntity: Name: NameFull: van Vliet, M. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 06 Text: 2010 Type: published Y: 2010 Identifiers: – Type: issn-print Value: 1206212X Numbering: – Type: volume Value: 32 – Type: issue Value: 2 Titles: – TitleFull: International Journal of Computers & Applications Type: main |
| ResultId | 1 |