Sciweavers

481 search results - page 27 / 97
» Multi-Objective Models for Scheduling Jobs on Parallel Compu...
Sort
View
77
Voted
JSSPP
2005
Springer
15 years 3 months ago
Modeling User Runtime Estimates
User estimates of job runtimes have emerged as an important component of the workload on parallel machines, and can have a significant impact on how a scheduler treats different ...
Dan Tsafrir, Yoav Etsion, Dror G. Feitelson
APSCC
2008
IEEE
15 years 4 months ago
Runtime Prediction Based Grid Scheduling of Parameter Sweep Jobs
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
Sam Verboven, Peter Hellinckx, Frans Arickx, Jan B...
JSSPP
2009
Springer
15 years 4 months ago
Decentralized Grid Scheduling with Evolutionary Fuzzy Systems
In this paper, we address the problem of finding workload exchange policies for decentralized Computational Grids using an Evolutionary Fuzzy System. To this end, we establish a n...
Alexander Fölling, Christian Grimme, Joachim ...
66
Voted
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
15 years 3 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
Michael Gatto, Peter Widmayer
JSSPP
2004
Springer
15 years 2 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...