206 search results - page 21 / 42 » Parallel Job Scheduling with Overhead: A Benchmark Study |
COR
2010
13 years 7 months ago
2010
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
CLUSTER
2004
IEEE
13 years 11 months ago
2004
IEEE
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
FSTTCS
2007
Springer
14 years 1 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
ESA
2009
Springer
14 years 7 days ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
HPDC
2010
IEEE
13 years 7 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...