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

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.