28 search results - page 4 / 6 » Preemptive Online Scheduling with Reordering |
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of...
JCO
2006
13 years 7 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
14 years 1 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 ...
TII
2008
13 years 7 months ago
2008
In distributed real-time systems, meeting the real-time constraints is mandatory but the satisfaction of other application-dependent criteria is most generally required as well. I...
GECON
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...