虚拟磁盘系统关联数据同步调度算法仿真研究  

Simulation Research on Synchronous Scheduling Algorithm of Virtual Disk System Associated Data

作　　者：王兰[1] 陆春吉[1] WANG Lan;LU Chun-ji(Beijing Jiaotong University Haibin College,Huanghua Hebei 061100,China)

机构地区：[1]北京交通大学海滨学院计算机与信息技术学院,河北黄骅061100

出　　处：《计算机仿真》2020年第9期432-435,共4页Computer Simulation

基　　金：北京交通大学海滨学院院级教科研项目(HBJY18009);河北省新工科研究与实践项目(2017GJXGK047)。

摘　　要：针对当前数据调度算法存在信道利用率低和冲突现象严重的问题,提出基于PSO的虚拟磁盘系统关联数据同步调度算法。以保障节点之间数据传输不冲突为前提,将虚拟磁盘系统信道利用率与最小时帧长度当作优化目标,构建关联数据同步调度模型。结合面向数据配置的广播式调度,对于广播式调度在多项式中无法得到最优解的情况,引入PSO算法对数据调度模型进行求解。通过混沌序列对粒子位置进行初始化,并在生成大量位置矢量中择优筛选出粒子初始种群位置矢量。在粒子进化过程中,引入混沌检索,将检索得到的最佳混沌序列转化成问题空间位置矢量,同时和目前粒子最优位置进行对比。假设比较结果为优于目前粒子,那么更新目前粒子最佳位置,并引导当前粒子在局部最优点中跳出快速寻找最优解。当满足算法结束条件时,将迭代中的全局最优解当作数据调度模型最优解输出。实验结果表明,上述算法调度数据时信道利用率高,调度冲突点少于当前算法。This article proposed an algorithm to dispatch associated data in virtual disk system synchronously based on PSO.On the premise of guaranteeing that the data transmission between nodes was not conflicted,the virtual disk system channel utilization and minimum time frame length were taken as the optimization targets,and then the mathematical model of associated data synchronization scheduling was constructed.Combined with the broadcast scheduling for data configuration,the broadcast scheduling can’t obtain the optimal solution in the polymerization,so PSO algorithm was used to solve the data scheduling model.After that,the particle position was initialized by the cha⁃otic sequence,and the initial population position vector of particle was selected from massive position vectors.During the particle evolution,chaotic retrieval was introduced and the best chaotic sequence was transformed into the position vector of problem space,which was compared with the current optimal position of particle.If the comparison result was better than the current particle,the current best position of particle was updated.Meanwhile,the current particle was guided to jump out from the local optimal point,so as to quickly find the optimal solution.When the end condi⁃tion of algorithm was satisfied,the global optimal solution in iteration was regarded as the optimal solution output of data scheduling model.Simulation results show that the algorithm has high channel utilization during the data schedu⁃ling.Meanwhile,the scheduling conflict point is less than that of current algorithm.

关 键 词：拟磁盘 关联数据 同步调度 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]