10106 search results - page 273 / 2022 » Algorithm Selection and Scheduling |
180
click to vote
RTS
2011
15 years 1 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...
147
click to vote
IPPS
2007
IEEE
16 years 28 days 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...
156
click to vote
GLOBECOM
2006
IEEE
16 years 21 days ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
175
click to vote
PPAM
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
147
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...