Virtualization technology has been widely used to virtualize single server into multiple servers, which not only creates an operating environment for a virtual machine-based cloud computing platform but also potential...Virtualization technology has been widely used to virtualize single server into multiple servers, which not only creates an operating environment for a virtual machine-based cloud computing platform but also potentially improves its efficiency. Currently, most task scheduling-based algorithms used in cloud computing environments are slow to convergence or easily fall into a local optimum. This paper introduces a Greedy Particle Swarm Optimization(G&PSO) based algorithm to solve the task scheduling problem. It uses a greedy algorithm to quickly solve the initial particle value of a particle swarm optimization algorithm derived from a virtual machine-based cloud platform. The archived experimental results show that the algorithm exhibits better performance such as a faster convergence rate, stronger local and global search capabilities, and a more balanced workload on each virtual machine. Therefore, the G&PSO algorithm demonstrates improved virtual machine efficiency and resource utilization compared with the traditional particle swarm optimization algorithm.展开更多
云计算中的基础设施层IaaS(Infrastructureas a Service)是通过虚拟化技术管理底层物理资源,向用户提供可用的计算机集群。对于如何有效的分配资源,使其利用率最大化,即使得物理机器中的各种资源的碎片最小也成了云计算中需要考虑的问...云计算中的基础设施层IaaS(Infrastructureas a Service)是通过虚拟化技术管理底层物理资源,向用户提供可用的计算机集群。对于如何有效的分配资源,使其利用率最大化,即使得物理机器中的各种资源的碎片最小也成了云计算中需要考虑的问题。针对这一问题,可以结合遗传算法来解决这种多目标多约束的组合优化问题,实现云虚拟环境下的资源分配问题。通过仿真实验表明,该算法可用有效的减少物理机器中的碎片,提高资源的利用率。展开更多
文摘Virtualization technology has been widely used to virtualize single server into multiple servers, which not only creates an operating environment for a virtual machine-based cloud computing platform but also potentially improves its efficiency. Currently, most task scheduling-based algorithms used in cloud computing environments are slow to convergence or easily fall into a local optimum. This paper introduces a Greedy Particle Swarm Optimization(G&PSO) based algorithm to solve the task scheduling problem. It uses a greedy algorithm to quickly solve the initial particle value of a particle swarm optimization algorithm derived from a virtual machine-based cloud platform. The archived experimental results show that the algorithm exhibits better performance such as a faster convergence rate, stronger local and global search capabilities, and a more balanced workload on each virtual machine. Therefore, the G&PSO algorithm demonstrates improved virtual machine efficiency and resource utilization compared with the traditional particle swarm optimization algorithm.
文摘云计算中的基础设施层IaaS(Infrastructureas a Service)是通过虚拟化技术管理底层物理资源,向用户提供可用的计算机集群。对于如何有效的分配资源,使其利用率最大化,即使得物理机器中的各种资源的碎片最小也成了云计算中需要考虑的问题。针对这一问题,可以结合遗传算法来解决这种多目标多约束的组合优化问题,实现云虚拟环境下的资源分配问题。通过仿真实验表明,该算法可用有效的减少物理机器中的碎片,提高资源的利用率。