614 search results - page 1 / 123 » Resource Minimization Job Scheduling |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
EUROPAR
2008
Springer
13 years 6 months ago
2008
Springer
We describe a scheduling technique in which estimated job runtimes and estimated resource availability are used to efficiently distribute workloads across a homogeneous grid of res...
ALGORITHMICA
2004
13 years 4 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
JSSPP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, a method for efficient scheduling to obtain optimum job throughput in a distributed campus grid environment is presented; Traditional job schedulers determine job s...