5 search results - page 1 / 1 » Minimizing the stretch when scheduling flows of divisible re... |
SCHEDULING
2008
13 years 4 months ago
2008
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcast...
ALGORITHMICA
2004
13 years 5 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Broadcasting is known to be an efficient means of disseminating data in wireless communication environments (such as Satellite, mobile phone networks,...). It has been recently ob...