206 search results - page 10 / 42 » Better Bounds for Online Scheduling |
103
click to vote
WAOA
2010
Springer
14 years 7 months ago
2010
Springer
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
86
Voted
RTCSA
2009
IEEE
15 years 4 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...
DCOSS
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the problem of multihop broadcast over adaptively duty-cycled wireless sensor networks (WSNs) where neighborhood nodes are not simultaneously awake. We presen...
ESA
2006
Springer
15 years 1 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 ...