多QoS约束下的PSO云存储任务调度算法  

Task scheduling algorithm in cloud storage system using PSO with multiple QoS constrain

作　　者：李飞[1] 易傅潇 王浩[1] 

机构地区：[1]成都信息工程学院信息安全工程学院,四川成都610225

出　　处：《计算机工程与设计》2015年第7期1767-1770,1807,共5页Computer Engineering and Design

基　　金：四川省应用基础计划基金项目(2013JY0064)

摘　　要：为研究云存储系统任务调度的问题,根据云存储系统的特点,前人已通过存在矩阵对PSO算法初始化与迭代更新进行约束,解决了PSO初始化以及迭代解对于云存储无意义的问题,使得PSO调度算法的迭代次数以及执行时间大幅降低,但其未充分考虑网络当前的状态以及网络服务质量问题。针对这一缺点,通过多QoS约束改进PSO调度算法在QoS要求下的性能特征,使解更符合当前网络的状态以及用户对多QoS的需求。实验结果表明,虽然迭代次数和运行时间没有明显的变化,但是相对于现有算法在多QoS性能方面平均满足率仅有33%,QoS约束将该值改进至45.6%,满足多QoS的需求。To study the task scheduling of cloud storage system,according to the characteristics of the cloud storage system,predecessors have addressed the problem of PSO-based arithmetic initialization and iteration by means of the exiting matrix,which finds the solution to the cloud storage meaninglessness issue.Therefore,the iterations and the execution time of PSO scheduling algorithm have been reduced significantly.Nevertheless,it fails to take full account of the current state of the network and QoS.To solve this problem,according to multiple QoS constrains,the performance characteristics of the PSO scheduling algorithm under the requirement of QoS were improved,and the solution could conform to the current network state and the user＇s requirement of multi-QoS.The simulation results indicate that the iterations and the execution time do not change obviously.But as to the mere 33%fill rate of the existing multi-QoS algorithm on average,it can rise to 45.6%through QoS constrain.

关 键 词：云存储 多QOS约束 任务调度 存在矩阵 粒子群算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]