Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fairness in Scheduling (Extended Abstract)
 

Summary: Fairness in Scheduling
(Extended Abstract)
Miklos Ajtai James Aspnesy Moni Naorz Yuval Rabanix Leonard J. Schulman{
Orli Waartsk
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 unfairnessof a system is the maximum,
taken over all processes, of the di erence between the desired
load and the actual load.
An example of such a setting is the carpool problem
suggested by Fagin and Williams 17]. 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

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences