The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
MagPIe: MPI's collective communication operations for clustered wide area systems
Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming
The distributed ASCI Supercomputer project
ACM SIGOPS Operating Systems Review
Packing Schemes for Gang Scheduling
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Towards Convergence in Job Schedulers for Parallel Supercomputers
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Improved Utilization and Responsiveness with Gang Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
The Performance Impact of Advance Reservation Meta-scheduling
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Framework for Mapping with Resource Co-Allocation in Heterogeneous Computing Systems
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Optimizing Parallel Applications for Wide-Area Clusters
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Local versus Global Schedulers with Processor Co-allocation in Multicluster Systems
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Priorities among Multiple Queues for Processor Co-Allocation in Multicluster Systems
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Characterization of Bandwidth-Aware Meta-Schedulers for Co-Allocating Jobs Across Multiple Clusters
The Journal of Supercomputing
Co-allocation with Communication Considerations in Multi-cluster Systems
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Towards feasible and effective load sharing in a heterogeneous computational grid
GPC'07 Proceedings of the 2nd international conference on Advances in grid and pervasive computing
Using moldability to improve scheduling performance of parallel jobs on computational grid
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Multisite co-allocation algorithms for computational grid
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Parallel job scheduling — a status report
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
The Journal of Supercomputing
Hi-index | 0.00 |
In systems consistingof multiple clusters of processors interconnected by relatively slow connections such as our Distributed ASCI1 Supercomputer (DAS), jobs may request co-allocation, i.e., the simultaneous allocation of processors in different clusters. The performance of co-allocation may be severely impacted by the slowintercluster connections, and by the types of job requests. We distinguish different job request types ranging from ordered requests that specify the numbers of processors needed in each of the clusters, to flexible requests that only specify a total. We simulate multicluster systems with the FCFS policy-- and with two policies for placinga flexible request, one tries to balance cluster loads and one tries to fill clusters completely--to determine the response times under workloads consistingof a single or of different request types for different communication speeds across the intercluster connections. In addition to a synthetic workload, we also consider a workload derived from measurements of a real application on the DAS. We find that the communication speed difference has a severe impact on response times, that a relatively small amount of capacity is lost due to communication, and that for a mix of request types, the performance is determined not only by the separate behaviours of the different types of requests, but also by the way in which they interact.