Affiliations: [a] Kish International Campus, Sharif University of Technology, Tehran, Iran
| [b] Department of Computer Engineering, Sharif University of Technology, Tehran, Iran
Correspondence:
[*]
Corresponding author. Ali Bakhthemmat, Kish International Campus, Sharif University of Technology, Tehran, Iran. E-mail: bakhthemmat@ce.sharif.edu.
Abstract: Many scientists apply fully dynamic bin packing problem solving for resource allocation of virtual machines in cloud environments. The goal of problem-solving is to reduce the number of allocated hosts (bins) and virtual machines (items) migration rates for reducing energy consumption. This study demonstrates a greedy futuristic algorithm (proposed algorithm) for fully dynamic bin packaging with an average asymptotic approximation ratio of 1.231, better than other existing algorithms. The proposed algorithm identifies inappropriate local selections using special futuristic conditions to prevent them as much as possible. Eventually, suitable choices determine and discard the improper ones. The proposed algorithm illustrates an asymptotic approximation ratio of (t/ (t-1)) OPT, where the value of t depends on the distribution of the arrived and departed items. Also, OPT is the number of bins by an optimal solution. Finally, in experiments of datasets using a maximum utilization of 80% of each bin, the average migration rate is 0.338. Using the proposed method for allocating resources in the cloud environment can allocate hosts to a virtual machine using almost optimal use. This allocation can reduce the cost of maintaining and purchasing hosts. Also, this method can reduce the migration rate of virtual machines. As a result, decreasing migration improves the energy consumption cost in the cloud environment.
Keywords: Fully dynamic bin packing, special futuristic conditions, futuristic
greedy, migration reducing
