82 search results - page 5 / 17 » Preemptive Online Scheduling: Optimal Algorithms for All Spe... |
102
click to vote
RTAS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
108
click to vote
SUTC
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose ...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
108
click to vote
AOR
2010
14 years 9 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...