740 search results - page 23 / 148 » Analysis of Scheduling Algorithms with Reservations |
RTS
2011
14 years 4 months ago
2011
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
JSSPP
2004
Springer
15 years 3 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
CORR
2008
Springer
14 years 9 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, ...
102
click to vote
TPDS
2010
14 years 8 months ago
2010
—Due to a continued increase in the speed and capacities of computing devices, combined with our society’s growing need for mobile communication capabilities, multihop wireless...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...