Download:
|
by Miklos Ajtai, James Aspnes, Moni Naor, Yuval Rabani, Leonard J. Schulman, Orli Waarts
http://www.cs.caltech.edu/~schulman/Papers/fair-sched.ps
Add To MetaCart
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 lived 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 carpool problem suggested by Fagin and Williams [16]. In this problem, a set of n people form a carpool. 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 carpool problems can capture several other problems of fairness in scheduling.
Citations
|
634
|
Amortized efficiency of list update and paging rules
– Sleator, Tarjan
- 1985
|
|
276
|
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks
– Ramakrishan, Jain
- 1990
|
|
269
|
Probabilistic computation, towards a unified measure of complexity
– Yao
- 1977
|
|
239
|
Bounds for certain multiprocessing anomalies
– Graham
- 1966
|
|
238
|
Analysis and Simulation of a Fair Queuing Algorithm
– Demers, Keshav, et al.
- 1989
|
|
174
|
High speed switch scheduling for local area networks
– Anderson, Owicki, et al.
- 1993
|
|
165
|
An optimal online algorithm for metrical task system
– Borodin, Linial, et al.
- 1992
|
|
163
|
Balanced allocations
– Azar, Broder, et al.
- 1999
|
|
127
|
On the power of randomization in on-line algorithms
– Ben-David, Borodin, et al.
- 1994
|
|
122
|
Scheduling parallel machines online
– Shmoys, Wein, et al.
- 1995
|
|
111
|
On-line load balancing with applications to machine scheduling and virtual circuit routing
– Aspnes, Azar, et al.
- 1997
|
|
102
|
New algorithms for an ancient scheduling problem
– Bartal, Fiat, et al.
- 1995
|
|
93
|
Round-Robin Scheduling for Max-Min Fairness in Data Networks
– Hahne
- 1991
|
|
84
|
An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback
– Charny
|
|
83
|
The competitiveness of online assignments
– Azar, Naor, et al.
- 1995
|
|
45
|
On the factorization of the complete uniform hypergraph, in: Infinite and finite sets
– Baranyai
- 1975
|
|
35
|
The chairman assignment problem
– Tijdeman
- 1980
|
|
24
|
Algorithms for scheduling tasks on unrelated processors
– Davis, Jaffe
- 1981
|
|
20
|
Integer-making theorems
– Beck, Fiala
- 1981
|
|
20
|
Private communication
– Coppersmith
- 1998
|
|
11
|
A Fair Carpool Scheduling Algorithm
– Fagin, Williams
- 1983
|
|
9
|
walls: analysis of a combinatorial game
– Disks
- 1989
|
|
7
|
Balanced two-colorings of finite sets in the cube
– Beck
- 1988
|
