On the Benefit of Processor Coallocation in Multicluster Grid Systems

Authors:
Ozan Sonmez;Hashim Mohamed;Dick Epema
Affiliations:
Technical University of Delft, Delft;Technical University of Delft, Delft;Technical University of Delft, Delft
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2010

Citing 0
Cited 5

Performance analysis of dynamic workflow scheduling in multicluster grids

Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
PFRF: An adaptive data replication algorithm based on star-topology data grids

Future Generation Computer Systems
Enhanced Dynamic Hierarchical Replication and Weighted Scheduling Strategy in Data Grid

Journal of Parallel and Distributed Computing
Combination of data replication and scheduling algorithm for improving data availability in Data Grids

Journal of Network and Computer Applications
TLA: Temporal look-ahead processor allocation method for heterogeneous multi-cluster systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In multicluster grid systems, parallel applications may benefit from processor coallocation, that is, the simultaneous allocation of processors in multiple clusters. Although coallocation allows the allocation of more processors than available in a single cluster, it may severely increase the execution time of applications due to the relatively slow wide-area communication. The aim of this paper is to investigate the benefit of coallocation in multicluster grid systems, despite this drawback. To this end, we have conducted experiments in a real multicluster grid environment, as well as in a simulated environment, and we evaluate the performance of coallocation for various applications that range from computation-intensive to communication-intensive and for various system load settings. In addition, we compare the performance of scheduling policies that are specifically designed for coallocation. We demonstrate that considering latency in the resource selection phase improves the performance of coallocation, especially for communication-intensive parallel applications.