.png){kind=icon}
.png){kind=icon}
Return
A discrete cuckoo optimization algorithm for consolidation computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2017.12.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Consolidation problems in cloud computing (CC) encompass server consolidation, virtual machine (VM) consolidation, and task consolidation. These problems have become increasingly challenging for resource allocation in distributed systems. Group technology (GT) has been effectively used to manage resource allocation problems by reducing manufacturing costs and increasing system productivity. We propose a discrete cuckoo optimization algorithm (DCOA) based on GT for consolidation in CC. The proposed model is designed to control manufacturing costs (i.e., energy, penalty, VM creating, and task migration). The DCOA developed in this study contains several new adjustments that allow it to solve large-sized discrete problems, including a grouping strategy based on the Jaccard similarity coefficient, as well as modified egg laying and immigration processes. A numerical example is used to demonstrate the applicability of the proposed model and exhibit the efficacy of the DCOA. The results illustrate the quality superiority of the DCOA over the first fit (FF) and round robin (RR) algorithms, and the efficiency and effectiveness superiority of the DCOA over the genetic algorithm (GA).
Keywords:
Cloud computing
Group technology
Mathematical model
Virtual machine
Cuckoo optimization algorithm
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
View more organizations