当前位置: X-MOL 学术Cluster Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An effective HPSO-MGA optimization algorithm for dynamic resource allocation in cloud environment
Cluster Computing ( IF 3.6 ) Pub Date : 2020-05-05 , DOI: 10.1007/s10586-020-03118-x
Vadivel Ramasamy , SudalaiMuthu Thalavai Pillai

Cloud computing is emerging as an increasingly popular computing paradigm, allowing dynamic scaling of resources available to users as needed. This requires a highly accurate demand prediction and a resource allocation methodology. The existing methodologies for dynamic resource allocation do not provide effective performance isolation between the VM and Artificial Demand Analysis machines since it gets affected by interferences. To overcome these issues, this paper proposes a conceptual model and an effective algorithm to achieve dynamic resource allocation by migrating tasks or requests in VMs. At first, task demands from the multiple users go to the feature extraction process. In feature extraction, features of the user's tasks and cloud server are extracted. Next both features are reduced by using Modified PCA algorithm to reduce the dynamic resource allocation processing time. Finally, both the features are combined and resource allocation is performed using Hybrid Particle Swarm Optimization and Modified Genetic Algorithm (HPSO-MGA). Then the optimized task has been scheduled to particular VM for allocating the resources. The experimental result of the proposed resource allocation methodology indicates better performance when compared with the existing methods Firefly and Krill herd Load Balancing (LB). For 100 VMs the reliability of HPSO-MGA is 0.87 but the exiting krill herd LB and IDSA gives 0.78 and 0.85, which is lower than the proposed one.



中文翻译:

用于云环境中动态资源分配的有效HPSO-MGA优化算法

云计算正在成为一种越来越流行的计算范例,可以根据需要动态扩展用户可用的资源。这需要高度准确的需求预测和资源分配方法。动态资源分配的现有方法无法在VM和人工需求分析机器之间提供有效的性能隔离,因为它会受到干扰的影响。为了克服这些问题,本文提出了一种概念模型和一种有效的算法,可以通过在VM中迁移任务或请求来实现动态资源分配。首先,来自多个用户的任务需求进入了特征提取过程。在特征提取中,将提取用户任务和云服务器的特征。接下来,通过使用修改的PCA算法减少动态资源分配处理时间,可以减少这两个功能。最后,使用混合粒子群优化和改进遗传算法(HPSO-MGA)将这两个功能组合在一起并进行资源分配。然后,将优化后的任务调度到特定的VM,以分配资源。与现有的Firefly和Krill牛群负载平衡(LB)方法相比,所提出的资源分配方法的实验结果表明具有更好的性能。对于100个虚拟机,HPSO-MGA的可靠性为0.87,但是现有的磷虾群LB和IDSA给出的可靠性为0.78和0.85,这比建议的低。结合了这两个功能,并使用混合粒子群优化和改进遗传算法(HPSO-MGA)进行了资源分配。然后,将优化后的任务调度到特定的VM,以分配资源。与现有的Firefly和Krill牛群负载平衡(LB)方法相比,所提出的资源分配方法的实验结果表明具有更好的性能。对于100个虚拟机,HPSO-MGA的可靠性为0.87,但是现有的磷虾群LB和IDSA给出的可靠性为0.78和0.85,这比建议的低。结合了这两个功能,并使用混合粒子群优化和改进遗传算法(HPSO-MGA)进行了资源分配。然后,将优化后的任务调度到特定的VM,以分配资源。与现有的Firefly和Krill牛群负载平衡(LB)方法相比,所提出的资源分配方法的实验结果表明具有更好的性能。对于100个VM,HPSO-MGA的可靠性为0.87,但是现有的磷虾群LB和IDSA给出的可靠性为0.78和0.85,低于建议的值。与现有的Firefly和Krill牛群负载平衡(LB)方法相比,所提出的资源分配方法的实验结果表明具有更好的性能。对于100个虚拟机,HPSO-MGA的可靠性为0.87,但是现有的磷虾群LB和IDSA给出的可靠性为0.78和0.85,这比建议的低。与现有的Firefly和Krill牛群负载平衡(LB)方法相比,所提出的资源分配方法的实验结果表明具有更好的性能。对于100个虚拟机,HPSO-MGA的可靠性为0.87,但是现有的磷虾群LB和IDSA给出的可靠性为0.78和0.85,这比建议的低。

更新日期:2020-05-05
down
wechat
bug