Sciweavers

JCO
2010
99views more  JCO 2010»
13 years 10 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
STOC
1997
ACM
129views Algorithms» more  STOC 1997»
14 years 3 months ago
Better Bounds for Online Scheduling
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
Susanne Albers
SWAT
2004
Springer
129views Algorithms» more  SWAT 2004»
14 years 4 months ago
Online Scheduling of Splittable Tasks in Peer-to-Peer Networks
We consider online scheduling of splittable tasks on parallel machines. In our model, each task can be split into a limited number of parts, that can then be scheduled independentl...
Leah Epstein, Rob van Stee