限制解空间的PSO云存储任务调度算法

Task scheduling algorithm in cloud storage system using PSO with limited solution domain

研究云存储系统中的任务调度算法。分析总结了任务调度在云存储和云计算系统中的不同,指出现有云计算中的PSO调度算法应用在云存储中时会产生对云存储系统来说无意义的解,即会要求系统节点提供它所不具有的数据。为解决此问题,改进现有的基于PSO的调度算法,引入存在矩阵的概念,将其初始化解和解的更新均限制于存在矩阵中,保证生成的解是有意义解。实验结果显示本调度算法可以节省约77%的迭代次数、缩短约4倍的执行时间,并保证产生对云存储系统有效的解。

This paper studied the task scheduling of the cloud storage system.Firstly,it analyzed the differences between the cloud storage and the cloud computing,and pointed out the existing PSO based task scheduling algorithm of cloud computing could not ensure the solution was meaningful to cloud storage,namely some solve may ask nodes offer data that they didn＇t have.In order to address these problems,the existing PSO based scheduling algorithm was improved by limiting the initialization solution and the solution search space in the exist solution space which could ensure solves were meaningful.The simulation results show that the algorithm can save 77% iteration times and also save about 4 times execution time and offer meaningful solutions for cloud storage system.