For the lack of safety studies to the task scheduling under the heterogeneous grid environment
a security benefit function is constructed under the consideration of the performance requirements such as confidentiality
integrity
authenticity
and so on. A dynamic method to evaluate the credibility of nodes and a new discrete particle swarm optimization algorithm are proposed 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. Hence
solution space redundancy of scheduling based on continuous space is avoided. Particle evolution equation is redefined by means of stepwise calculation and modification of particle positions
which avoids the problem of mutual speed interference during the evolution. A uniform disturbance speed is introduced to prevent the algorithm into a local optimum. Experiments and comparisons with the particle swarm optimization algorithm based on continuous space and the genetic algorithm show that the proposed algorithm has a faster convergence speed
a shorter scheduling length
and a higher safety performance.
关键词
Keywords
references
CHAKRABARTI A, DAMODARAN A, SENGUPTA S.Grid computing security: a taxonomy [J]. IEEE Security & Privacy, 2008, 6(1): 44-51.
SONG S S, HWANG Kai, KWOK Yu Kwong. Risk-resilient heuristics and genetic algorithms for security-assured grid job scheduling [J]. IEEE Trans on Computers, 2006, 55(6): 703-719.
PARK J S, AN G, CHANDRA D. Trusted P2P computing environments with role-based access control [J]. Information Security, 2007, 1(3): 27-35.
YUAN Lulai, ZENG Guosun, JIANG Lili, et al. Dynamic level scheduling based on trust model in grid computing [J]. Chinese Journal of Computers, 2006,29(7):1217-1224.
BRAUN T D, SLEGEL H J, BECJ N. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems [J]. IEEE Trans on Parallel and Distributed Computing, 2001, 61(6):810-837.
XUE Zhenghua, LIU Weizhe, DONG Xiaoshe, et al. Research on mind evolutionary computation based job scheduling for server clusters[J]. Journal of Xi'an Jiaotong University, 2008,42(2): 651-654.
KENNEDY I, EBERHART R. Particle swarm optimization [C]∥Proceedings of the Fourth IEEE International Conference on Neural Networks. Piscataway, NJ, USA: IEEE Service Center, 1995:1942-1948.
WANG Feng, XING Keyi,XU Xiaoping. A system identification method using particle swarm optimization[J]. Journal of Xi'an Jiaotong University, 2009,43(2): 116-120.
JI Yimu, WANG Ruchuan. Study on PSO algorithm in solving grid task scheduling [J]. Journal on Communications, 2007, 28(10): 60-66.
XIE T, QIN X. Security-aware resource allocation for real-Time parallel jobs on homogenous and heterogeneous clusters [J]. IEEE Trans on Parallel and Distributed Systems, 2008, 19(5): 682-697.
ZHU H, WANG Y P. Evolutionary algorithm for solving constrained multi-objective grid tasks scheduling problem[C]∥Proceeding of the 2009 International Conference on Computer Network and Multimedia Technology. Washington, DC, USA: IEEE Computer Society, 2009:10-14.
ZHU H, WANG Y P. Security-driven task scheduling based on evolutionary algorithm[C]∥Proceedings of the 2008 Computational Intelligence and Security. Washington, DC, USA: IEEE Computer Society, 2008: 451-456.
MENG Xianfu, ZHANG Xiaoyan. Parallel task scheduling strategy with multi-objective constrains in P2P [J].Computer Integrated Manufacturing Systems, 2008, 14(4): 761-766.
WU A S, YU H, JIN S, et al. An incremental genetic algorithm approach to multiprocessor scheduling [J]. IEEE Trans on Parallel and Distributed Systems, 2004, 15(9): 824-834.