摘要
为了提高云计算数据中心的资源利用率,动态优化部署虚拟机,提出基于K-均值聚类的虚拟机调度算法。使用虚拟机资源配置的相关性作为聚类的衡量标准,将虚拟机放置于与其资源互补的物理节点上,从而充分利用其资源,并具有高效稳定的特点。进一步设计了在线调度算法处理新到达虚拟机的请求。提出了贪婪算法,并给出了其与最优离线算法竞争比的上界。基于真实数据集的实验结果证实了算法的正确性。
To improve the resource utilization of cloud computing data centers and optimize virtual machines dynamically,a virtual machine scheduling algorithm is proposed based on K-means clustering. The correlation of virtual machine resource allocation is used as the standard of clustering,and a virtual machine is placed on the physical node complementary to it on resource,so that its resource is used fully and it is effective and stable. An online scheduling algorithm is designed to handle the requirements of new virtual machines. A greedy algorithm is proposed,and the upper bound of the competitive ratio between it and the optimal offline algorithm is given. The correctness of this algorithm is verified based on the experimental results of real data sets.
出处
《南京理工大学学报》
EI
CAS
CSCD
北大核心
2013年第6期807-812,共6页
Journal of Nanjing University of Science and Technology
基金
南京工程学院校级科研基金(创新基金)(CKJ2010010)
关键词
云计算
K-均值聚类
虚拟机
调度
贪婪算法
cloud computing
K-means clustering
virtual machine
scheduling
greedy algorithm
