614 search results - page 34 / 123 » Resource Minimization Job Scheduling |
117
click to vote
CCGRID
2004
IEEE
15 years 8 months ago
2004
IEEE
In a Computational Grid which consists of many computer clusters, job start time predictions are useful to guide resource selections and balance the workload distribution. However...
115
Voted
DAGSTUHL
2006
15 years 5 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
156
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
131
click to vote
JCP
2008
15 years 4 months ago
2008
Abstract--Scheduling algorithm for batch-mode dataintensive jobs is a key issue in data-intensive Grid applications. It focuses on how to minimize the overhead of transferring the ...
138
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...