206 search results - page 9 / 42 » Parallel Job Scheduling with Overhead: A Benchmark Study |
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
DAGSTUHL
2007
13 years 9 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
EOR
2008
13 years 7 months ago
2008
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
JSSPP
2004
Springer
14 years 28 days ago
2004
Springer
This paper presents a comprehensive characterization of a multi-cluster supercomputer1 workload using twelvemonth scientific research traces. Metrics that we characterize include...