Model-based optimization for data-intensive application on virtual cluster

Authors:
K. Sato;H. Sato;S. Matsuoka
Affiliations:
Tokyo Inst. of Technol., Tokyo;Tokyo Inst. of Technol., Tokyo;Nat. Center of Sci., Nat. Inst. of Inf., Tokyo
Venue:
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Year:
2008

Citing 2
Cited 2

A taxonomy of Data Grids for distributed data sharing, management, and processing

ACM Computing Surveys (CSUR)
Virtual Clusters on the Fly - Fast, Scalable, and Flexible Installation

CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid

Performance and energy modeling for live migration of virtual machines

Proceedings of the 20th international symposium on High performance distributed computing
Performance and energy modeling for live migration of virtual machines

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a model-based optimization algorithm that determines virtual machine(VM) migration strategies, i.e., which VMs should be migrated to which nodes, while minimizing I/O access costs. We solve this problem as a shortest path problem of a direct acyclic graph which minimizes overall data access costs of target file accesses. Our simulation-based studies suggest that the proposed algorithm can achieve higher performance than simple techniques, such as ones that never migrate VMs or always migrate VMs onto the nodes that hold target files.