720 search results - page 57 / 144 » Broadcast scheduling: algorithms and complexity |
152
click to vote
CLUSTER
2008
IEEE
16 years 20 days ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
185
click to vote
MICRO
2005
IEEE
15 years 11 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
169
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...
250
click to vote
INFOCOM
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper we present algorithms for flow admission control at an EDF link scheduler when the flows are characterized by peak rate, average rate and burst size. We show that th...
170
click to vote
INFOCOM
2007
IEEE
16 years 14 days ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...