采用离散粒子群算法的网格任务安全级调度_朱海.pdfVIP

44 6 西 安 交 通 大 学 学 报 Vol. 44 l 6 2010 6 JOU RNA L OF XIcAN JIAOT ONG UNIVERSIT Y Jun. 2010 , , , ( , 100 1, ) : 针对异构网格环境中任务调度问题对所面临的安全性研究不 , 在考虑了保密性完整性和 真实性等安全性因素的情况下, 构造了相应的安全效益函数; 依据网格节点的历史行为特点, 提出 了节点的信誉度动态评估策略; 基于行为特点提出了一种离散粒子群算法, 由此建立了任务安全级 调度新模型. 算法基于安全调度的离散空间特征给出了粒子的位置表示方法, 从而克服了连续空间 解决离散问题所造成的解空间冗余问题. 采用分步计算和修改粒子位置的方式重新定义了粒子进 化方程, 避免了进化过程中速度之间的相互干扰问题. 为了防止算法陷入局部最优, 引入了均匀扰 动速度. 实验结果表明, 与基于连续空间的粒子群算法和遗传算法相比, 所提算法具有较快的收敛 速度较短的调度长度和较高的安全性能. : 网格计算; 任务调度; 安全模型; 离散粒子群算法 : TP393 : A : 0253-98 X( 2010) 06-0021-06 Security Scheduling of Grid Tasks Based on the Discrete Particle Swarm Algorithm ZHU Hai, WANG Yuping, QUAN Yining, WANG Xiaoli ( School of Com puter Science and T echnology, Xidian U niversity, Xican 100 1, China) Abstract: For the lack of safety studies to the task scheduling under the heterogeneous grid envi- ronment, a security benefit function is constructed under the consideration of the performance re- quirements such as confidentiality , integrity, authenticity, and so on. A dynamic method to eval- uate the credibility of nodes and a new discrete particle sw arm optimization algorithm are pro- posed based on the characteristics of historical behavior of grid resource nodes. Then a new model to schedule task security levels is established. The algorithm gives representation for particle locations based on the discrete space features of security scheduling. H ence, solution space re- dundancy of scheduling based on continuous space is avoided. Particle evolution equation is rede- fined by means of stepw ise calculation and modification of particle positions, w hich avoids th