Sciweavers

206 search results - page 16 / 42
» Parallel Job Scheduling with Overhead: A Benchmark Study
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
ICS
2000
Tsinghua U.
13 years 11 months ago
A simulation-based study of scheduling mechanisms for a dynamic cluster environment
Scheduling of processes onto processors of a parallel machine has always been an important and challenging area of research. The issue becomes even more crucial and di cult as we ...
Yanyong Zhang, Anand Sivasubramaniam, José ...
IPPS
2003
IEEE
14 years 26 days ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
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...
Anca I. D. Bucur, Dick H. J. Epema
IPPS
1998
IEEE
13 years 12 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
PPOPP
2009
ACM
14 years 8 months ago
Application-aware management of parallel simulation collections
This paper presents a system deployed on parallel clusters to manage a collection of parallel simulations that make up a computational study. It explores how such a system can ext...
Siu Yau, Vijay Karamcheti, Denis Zorin, Kostadin D...