Bandwidth-aware co-allocating meta-schedulers for mini-grid architectures

Authors:
W. M. Jones;L. W. Pang;W. B. Ligon;D. Stanzione
Affiliations:
Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA;Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA;Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA;-
Venue:
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
Year:
2004

Citing 0
Cited 6

Characterization of Bandwidth-Aware Meta-Schedulers for Co-Allocating Jobs Across Multiple Clusters

The Journal of Supercomputing
Cross-Platform Performance Prediction of Parallel Applications Using Partial Execution

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Scheduling Policies for Processor Coallocation in Multicluster Systems

IEEE Transactions on Parallel and Distributed Systems
HPC virtual machine resource management

Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities
Co-allocation with Communication Considerations in Multi-cluster Systems

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Dynamic virtual clustering with xen and moab

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The interaction of simultaneously co-allocated jobs can often create contention in the network infrastructure of a dedicated computational grid. This contention can lead to degraded job run-time performance. We present several bandwidth-aware co-allocating meta-schedulers. These schedulers take into account inter-cluster network utilization as a means by which to mitigate this impact. We make use of a bandwidth-centric parallel job communication model that captures the time-varying utilization of shared inter-cluster network resources. By doing so, we are able to evaluate the performance of grid scheduling algorithms that focus not only on node resource allocation, but also on shared inter-cluster network bandwidth.