Sciweavers

375 search results - page 6 / 75
» On-Line Scheduling of Parallel Jobs
Sort
View
ANSS
2002
IEEE
14 years 19 days ago
Scheduling a Job Mix in a Partitionable Parallel System
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...
Helen D. Karatza, Ralph C. Hilzer Jr.
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
13 years 11 months ago
Preemptive Scheduling with Rejection
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...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
14 years 1 months ago
Stochastic Online Scheduling on Parallel Machines
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 ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
IPPS
1999
IEEE
13 years 12 months ago
On the Design and Evaluation of Job Scheduling Algorithms
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 ...
Jochen Krallmann, Uwe Schwiegelshohn, Ramin Yahyap...