375 search results - page 6 / 75 » On-Line Scheduling of Parallel Jobs |
221
click to vote
ANSS
2002
IEEE
16 years 9 days ago
2002
IEEE
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
220
click to vote
ESA
2000
Springer
15 years 11 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
198
Voted
WAOA
2004
Springer
16 years 20 days ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
138
Voted
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
207
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...