Title: Optimising data access latencies of virtual machine placement based on greedy algorithm in datacentre

Authors: Xinyan Zhang; Keqiu Li; Yong Zhang

Addresses: School of Computer Science and Technology, Dalian University of Technology, Dalian, China ' School of Computer Science and Technology, Dalian University of Technology, Dalian, China ' School of Computer and Information Technology, Liaoning Normal University, Dalian, China

Abstract: The total completion time of a task is also the major bottleneck in the big data processing applications based on parallel computation, since the computation and data are distributed on more and more nodes. Therefore, the total completion time of task is an important index to evaluate the cloud performance. The access latency between the nodes is one of the key factors affecting task completion time for cloud applications. Additionally, minimising total access time can reduce the overall bandwidth cost of running the job. This paper proposes an optimisation model focused on optimising VMs placement so as to minimise the total data access latency where the datasets have been located. According to the proposed model, our optimising VMs problem is linear programming. Therefore, we obtain the optimum solution of our model by the branch-and-bound algorithm with time complexity O(2^NM). Simultaneously, we also present a greedy algorithm, which has O(NM) of time complexity, to solve our model. Finally, the simulation results show that all of the solutions of our model are superior to existing models and close to the optimal value.

Keywords: datacentre; cloud environment; access latency; virtual machine placement; greedy algorithm.

DOI: 10.1504/IJCSE.2019.097945

International Journal of Computational Science and Engineering, 2019 Vol.18 No.2, pp.186 - 194

Received: 28 Jun 2016
Accepted: 10 Aug 2016
Published online: 25 Feb 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article