33 search results - page 4 / 7 » Preemptive Scheduling on Selfish Machines |
MFCS
2004
Springer
14 years 23 days ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
ESA
2009
Springer
14 years 23 hour ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...