Fairness in scheduling

Miklos Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

On-line machine scheduling has been studied extensively, but the fundamental issue of fairness in scheduling is still mostly open. In this paper we explore the issue in settings where there are long living processes which should be repeatedly scheduled for various tasks throughout the lifetime of a system. For any such instance we develop a notion of desired load of a process, which is a function of the tasks it participates in. The unfairness of a system is the maximum, taken over all processes, of the difference between the desired load and the actual load. An example of such a setting is the carpooi problem suggested by Fagin and Williams [17]. In this problem, a set of n people form a carpooi. On each day a subset of the people arrive and one of them is designated as the driver. A scheduling rule is required so that the driver will be determined in a 'fair' way. We investigate this problem under various assumptions on the input distribution. We also show that the carpooi problems can capture several other problems of fairness in scheduling.

Original languageAmerican English
Title of host publicationProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
PublisherAssociation for Computing Machinery
Pages477-485
Number of pages9
ISBN (Electronic)0898713498
StatePublished - 22 Jan 1995
Externally publishedYes
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: 22 Jan 199524 Jan 1995

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
Country/TerritoryUnited States
CitySan Francisco
Period22/01/9524/01/95

Bibliographical note

Funding Information:
tDept. of Computer Science, Yale University. Supported by NSF grant CCR-9410228. During part of this research this author was visiting IBM Almaden Research Center. E-Mail: aspnes@cs.yale.edu *Incumbent of the Morris and Rose Goldman Career Development Chair, Dept. of Applied Math and Computer Science, Weizmann Institute, Israel. Research supported by an Alon Fellowship and a grant from the Israel Science Foundation administered by the Israeli Academy of Sciences. E-Mail: naor@wisdom.weizmann.ac.il §This work was done while the author was at ICSI, Berkeley, and at the Lab. for Computer Science, MIT. Work at ICSI supported by a Rothschild postdoctoral fellowship. Work at MIT supported by ARPA/Army contract DABT63-93-C-0038. Present address: Department of Computer Science, University of Toronto, Toronto, Ontario M5S 1A4, E-mail: rabani@cs.toronto.edu.

Funding Information:
Supported by NSF grant CCR-9410228. During part of this research this author was visiting IBM Almaden Research Center

Funding Information:
acomputer Science supported by an NSF schulman@cs.berkeley.edu

Fingerprint

Dive into the research topics of 'Fairness in scheduling'. Together they form a unique fingerprint.

Cite this