254 search results - page 11 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
CORR
2010
Springer
15 years 1 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
103
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
Grid jobs often consist of a large number of tasks. If the performance of a statically scheduled grid job is unsatisfactory, one must decide which code of which task should be imp...
116
click to vote
JSSPP
2009
Springer
15 years 7 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...
124
click to vote
HPCC
2007
Springer
15 years 7 months ago
2007
Springer
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
126
click to vote
SODA
2001
ACM
15 years 2 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 ...