82 search results - page 3 / 17 » Preemptive Online Scheduling: Optimal Algorithms for All Spe... |
JCO
2006
14 years 9 months ago
2006
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
RTAS
2008
IEEE
15 years 4 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
110
click to vote
SIGCOMM
2012
ACM
13 years 15 hour ago
2012
ACM
Today’s data centers face extreme challenges in providing low latency. However, fair sharing, a principle commonly adopted in current congestion control protocols, is far from o...
DAC
2010
ACM
15 years 1 months ago
2010
ACM
System optimization techniques based on dynamic voltage scaling (DVS) are widely used with the aim of reducing processor energy consumption. Inter-task DVS assigns the same voltag...
SODA
2010
ACM
15 years 7 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...