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 language | English |
|---|---|
| Title of host publication | Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 |
| Publisher | Association for Computing Machinery |
| Pages | 477-485 |
| Number of pages | 9 |
| ISBN (Electronic) | 0898713498 |
| State | Published - 22 Jan 1995 |
| Externally published | Yes |
| Event | 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States Duration: 22 Jan 1995 → 24 Jan 1995 |
Publication series
| Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|
Conference
| Conference | 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 |
|---|---|
| Country/Territory | United States |
| City | San Francisco |
| Period | 22/01/95 → 24/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: [email protected] *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: [email protected] §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: [email protected].
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 [email protected]