206 search results - page 14 / 42 » Parallel Job Scheduling with Overhead: A Benchmark Study |
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
CCGRID
2003
IEEE
14 years 27 days ago
2003
IEEE
In systems consisting of multiple clusters of processors which are interconnected by relatively slow communication links and which employ space sharing for scheduling jobs, such a...
DAGSTUHL
2006
13 years 9 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 ...
CLUSTER
2006
IEEE
13 years 7 months ago
2006
IEEE
This paper proposes a new scheduling policy for cluster-based servers called DAS (Deferred Assignment Scheduling). The main idea in DAS is to defer scheduling as much as possible,...
GRID
2008
Springer
13 years 8 months ago
2008
Springer
Large-scale computing environments, such as TeraGrid, Distributed ASCI Supercomputer (DAS), and Grid’5000, have been using resource co-allocation to execute applications on mult...