.png){kind=icon}
Return
Dynamic Resource Prediction and Allocation for Cloud Data Center Using the Multiobjective Genetic Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/JSYST.2017.2722476.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to optimize the resource utilization of physical machines (PMs), the workload prediction of virtual machines (VMs) is vital but challenging. Most of existing literatures focus on either resource prediction or allocation individually, but both of them are highly correlated. In this paper, we propose a multiobjective genetic algorithm (GA) to dynamically forecast the resource utilization and energy consumption in cloud data center. We formulate a multiobjective optimization problem of resource allocation, which considers the CPU and memory utilization of VMs and PMs, and the energy consumption of data center. The proposed GA forecasts the resource requirement of next time slot according to the historical data in previous time slots. We further propose a VM placement algorithm to allocate VMs for next time slot based on the prediction results of GA. In our simulation-based analysis, the optimal solution for resource prediction under stable and unstable utilization tendency is found by the proposed GA. The prediction result is superior to the previous proposed Grey forecasting model. Results show that the proposed VM placement algorithm not only increases the average utilization level of CPU and memory but also decreases the energy consumption of cloud data center.
Keywords:
Cloud data center
genetic algorithm (GA)
multiobjective optimization (MOO)
resource allocation
resource prediction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
2.4
Papers:
4.5K
Citations:
387
Organization
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveToward Energy-Efficient Cloud Computing: Prediction, Consolidation, and Overcommitment.png)
IEEE NETWORK
IEEE NETWORKIF6.3
PREAI
ShareSaveA new and efficient ant-based heuristic method for solving the traveling salesman problemEXPERT SYSTEMS
EXPERT SYSTEMSIF2.3
PREAI
ShareSaveShareSave
View more