70 search results - page 1 / 14 » Online Scheduling to Minimize the Maximum Delay Factor |
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...
ESA
2009
Springer
13 years 12 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
DATE
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper investigates retiming and clock skew scheduling for improving the tolerance of synchronous circuits to delay variations. It is shown that when both long and short paths...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—Energy conservation is drawing increasing attention in data networking. One school of thought believes that a dominant amount of energy saving comes from turning off network ele...