一种基于多目标的容器云任务调度算法

A scheduling algorithm based on multi-objective container cloud task

为解决容器云调度模型面向同构任务、同构资源和单一目标造成的不实用、不公平、不高效、不均衡问题,提出带约束修复的树形调度目标模型,基于异构任务和异构资源,采用约束修复避免映射方案不可行,采用优先级综合多个子目标并将其归属于不同树形分支下的子空间,最终实现多个上层应用框架之间的公平、高效、节约、均衡调度模型。试验结果表明,带约束修复的树形调度目标模型在公平度上不比其它对比单目标模型差,可满足更多的任务的需求,并在此前提下拥有更高的资源利用率和负载均衡度,在实用性、公平性、高效与均衡上优于单目标模型,可有效保证公平分配资源,增加容器服务收益,降低物理资源成本,提高稳定性和可用性。

In order to solve the unrealistic,unfair,inefficient and unbalanced problems caused by container cloud scheduling model facing isomorphic tasks,isomorphic resources and single objectives,a tree scheduling objective model with constraint repair was proposed.Based on heterogeneous tasks and resources,constraint repair was adopted to avoid the impracticability of mapping scheme,and then priority to synthesize multiple sub-goals and attributed them to sub-spaces under different tree branches,and eventually achieved a fair,efficient,economical and balanced scheduling model among multiple upper application frameworks.The experimental results showed that the tree scheduling objective model with constrained repair was not inferior to other single-objective models in fairness,which could meet more tasks,and had higher resource utilization and load balancing under the preceding conditions.It was superior to the single-objective model in practicability,fairness,efficiency and balancing and ensured fair allocation of resources,which increased the benefits of container services,decreased the cost of physical resources,increased the stability and availability.