254 search results - page 24 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
HPDC
1996
IEEE
15 years 1 months ago
1996
IEEE
In this paper a model for scheduling in wide-area systems is described. The model is federated and utilizes a collection of local site schedulers that control the use of their res...
77
Voted
SCHEDULING
2008
14 years 9 months ago
2008
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
87
Voted
COR
2006
14 years 9 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Clusters are mostly used through Resources Management Systems (RMS) with a static allocation of resources for a bounded amount of time. Those approaches are known to be insufficie...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...