720 search results - page 81 / 144 » Broadcast scheduling: algorithms and complexity |
152
click to vote
ECCC
2000
15 years 6 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
167
Voted
COMCOM
2004
15 years 6 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
162
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
As computing systems of all types grow in power and complexity, it is common to want to simultaneously execute processes with different timeliness constraints. Many systems use CP...
166
click to vote
CAV
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
191
Voted
ICPADS
1998
IEEE
15 years 10 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...