Email this article Grid Dependent Tasks Security Scheduling Model and DPSO Algorithm
Abstract
Due to the security threat to task scheduling problems in the grid environment, by considering both the inherent security and behavior safety of grid resource nodes, security benefit functions and credibility assessment strategies of grid resource nodes are constructed respectively. At the same time, the corresponding membership function is established in order to establish the membership between task security requirements and resource security attributes. Based on these, a new grid dependent tasks security scheduling model is set up. In order to solve this model, the particle evolution equation is re-designed by combining the specific characteristics of the dependent task scheduling problem. Meanwhile, in order to prevent the algorithm falling into local optimum, a uniform speed of disturbance is adopted and a new discrete Particle Swarm Optimization algorithm is proposed. Simulation results show that this algorithm has better scheduling length and higher safety performance than the genetic algorithm.
Keywords
References
[1] Metke A R, Ekl R L. Security Technology for Smart Grid Networks[J]. IEEE Trans on Smart Grid, 2010,1(1):99-107.
[2] 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.
doi:10.1109/TC.2006.89
[3] Park J.S., An G., Chandra D. Trusted P2P computing environments with role-based access control[J], Information Security, 2007, 1(3): 27-35.
doi:10.1049/iet-ifs:20060084
[4] Liao H M, Wang Q P, Li G X. A Fuzzy Logic-Based Trust Model in Grid[M]. International conference on networks security, wireless communications and trusted Computing, NSWCTC '09. IEEE Press, 2009(4): 608-614.
[5] 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.
[6] Wu X Z, Srikant, R., Perkins J R. Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks [J]. IEEE Transactions on Mobile Computing, 2007, 6(6): 595 - 605
doi:10.1109/TMC.2007.1061
[7] Hou, E S H., Ansari N, Hong R. A genetic algorithm for multiprocessor scheduling [J]. IEEE Trans on Parallel and Distributed Systems, 1994, 5(2): 113 - 120
doi:10.1109/71.265940
[8] Kennedy I, Eberhart R. Particle swarm optimization[C]. Proceedings of the Fourth IEEE International Conference on Neural Networks. Perth, Australia: IEEE Press, 1995.
[9] Wei J X, Wang Y P. Fuzzy particle swarm optimization for constrained optimization problems[J]. Journal of Electronics and Information Technology, 2008, 30(5):1218-1221.
doi:10.3724/SP.J.1146.2007.00689
[10] Ji Y M, Wang R C. Study on PSO algorithm in solving grid task scheduling[J]. Journal on Communications, 2007, 28(10): 60-66.
[11] Zhang D F, Zhu H, Wang Y P. Tasks Security Scheduling Based on DPSO in Heterogeneous Grid Environment. The 2nd International Conference on Networks Security, Wireless Communications and Trusted Computing, NSWCTC2010, Wuhan, China:IEEE Press,2010, Vol.1: 143-148.
[12] Zhu H, Wang Y P. Security-Driven Task Scheduling Based on Evolutionary Algorithm[M].Proceeding of the Computational Intelligence and Security 2008, IEEE Press, 2008(12) :451-456.
[13] Meng Xian-fu, Zhang Xiao-yan. Parallel task scheduling strategy with multi-objective constrains in P2P [J].Computer Integrated Manufacturing Systems, 2008, 14(4): 761-766.
[14] Wu, A.S., Yu, H., Jin, S., etal. An incremental genetic algorithm approach to multiprocessor scheduling [J]. IEEE Trans on Parallel and Distributed Systems, 2004, 15(9): 824-834.
doi:10.1109/TPDS.2004.38
Full Text: PDF