Sciweavers

68 search results - page 3 / 14
» Improving Parallel Job Scheduling by Combining Gang Scheduli...
Sort
View
CLUSTER
2004
IEEE
13 years 9 months ago
A comparison of local and gang scheduling on a Beowulf cluster
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...
Peter E. Strazdins, John Uhlmann
EUROPAR
1998
Springer
13 years 9 months ago
A Lower Bound for Dynamic Scheduling of Data Parallel Programs
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
Fabrício Alves Barbosa da Silva, Luis Migue...
IPPS
2003
IEEE
13 years 10 months ago
Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources
Fine-grained parallel applications require all their processes to run simultaneously on distinct processors to achieve good efficiency. This is typically accomplished by space sl...
Eitan Frachtenberg, Dror G. Feitelson, Fabrizio Pe...
MIDDLEWARE
2007
Springer
13 years 11 months ago
Using checkpointing to recover from poor multi-site parallel job scheduling decisions
Recent research in multi-site parallel job scheduling leverages user-provided estimates of job communication characteristics to effectively partition the job across multiple clus...
William M. Jones
EUROPAR
2004
Springer
13 years 10 months ago
Scheduling of MPI Applications: Self-co-scheduling
Scheduling parallel jobs has been an active investigation area. The scheduler has to deal with heterogeneous workloads and try to obtain throughputs and response times such that en...
Gladys Utrera, Julita Corbalán, Jesú...