期刊文献+

Multi-objective workflow scheduling in cloud system based on cooperative multi-swarm optimization algorithm 被引量:2

Multi-objective workflow scheduling in cloud system based on cooperative multi-swarm optimization algorithm
下载PDF
导出
摘要 In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms. In order to improve the performance of multi-objective workflow scheduling in cloud system, a multi-swarm multiobjective optimization algorithm(MSMOOA) is proposed to satisfy multiple conflicting objectives. Inspired by division of the same species into multiple swarms for different objectives and information sharing among these swarms in nature, each physical machine in the data center is considered a swarm and employs improved multi-objective particle swarm optimization to find out non-dominated solutions with one objective in MSMOOA. The particles in each swarm are divided into two classes and adopt different strategies to evolve cooperatively. One class of particles can communicate with several swarms simultaneously to promote the information sharing among swarms and the other class of particles can only exchange information with the particles located in the same swarm. Furthermore, in order to avoid the influence by the elastic available resources, a manager server is adopted in the cloud data center to collect the available resources for scheduling. The quality of the proposed method with other related approaches is evaluated by using hybrid and parallel workflow applications. The experiment results highlight the better performance of the MSMOOA than that of compared algorithms.
作者 YAO Guang-shun DING Yong-sheng HAO Kuang-rong 姚光顺;丁永生;郝矿荣
出处 《Journal of Central South University》 SCIE EI CAS CSCD 2017年第5期1050-1062,共13页 中南大学学报(英文版)
基金 Project(61473078)supported by the National Natural Science Foundation of China Project(2015-2019)supported by the Program for Changjiang Scholars from the Ministry of Education,China Project(16510711100)supported by International Collaborative Project of the Shanghai Committee of Science and Technology,China Project(KJ2017A418)supported by Anhui University Science Research,China
关键词 MULTI-OBJECTIVE WORKFLOW scheduling multi-swarm OPTIMIZATION particle SWARM OPTIMIZATION (PSO) CLOUD computing system multi-objective workflow scheduling multi-swarm optimization particle swarm optimization(PSO) cloud computing system
  • 相关文献

参考文献1

二级参考文献25

  • 1SRINIVAS N, DEB K. Mutiobjective optimization using nondominated sorting in genetic algorithms [J]. Evolutionary Computation, 1994,2(3): 221-248.
  • 2DEB K, PRATAP A, AGARWAL S, MEYARIVAN T. A fast and elitist nondominated sorting genetic algorithm for multiobjective optimization: NSGA II [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2): 182-197.
  • 3ZITZLER E, THIELE L. Multiobjective^volutionary algorithms: A comparative case study and the strength Pareto approach [J]. IEEE Transactions on Evolutionary Computation, 1999, 3(3): 257-271.
  • 4ZITZLER E, LAUMANNS M, THIELE L. SPEA2: Improving the strength Pareto evolutionary algorithms [C]// Evolutionary for Design, Optimization and Control with Application to an Industrial Problems (EUROGEN2001). Barcelona, Spain, 2002: 95-100.
  • 5MONTES DE OCA M A, STUTZLE T, BIRATTARI M, DORIGO M. Frankenstein’s PSO: A composite particle swarm optimization algorithm [J]. IEEE Transactions on Evolutionary Computation, 2009, 13(5): 1120-1132.
  • 6COIN A. Ant colony algorithms [J], Dr Dobb’s Journal, 2006, 31(9): 46-51.
  • 7ZHANG Jun, CHUNG H S H, LO A W L, HUANG Tao. Ended ant colony optimization algorithm for power electronic circuit design [J]. IEEE Transactions on Power Electronics, 2009, 24(1): 147-162.
  • 8HEY T. Quantum computing: An introduction [J]. Computing & Control Engineering Journal, 1999, 10(3): 105—112.
  • 9HAN K H, KIM J H. Quantum-inspired evolutionary algorithm for a class of combinatorial optimization [J]. IEEE Transactions on Evolutionary Computation, 2002, 6(6): 580-593.
  • 10JIAO Li-cheng, LI Yang-yang, GONG Mao-guo, ZHANG Xiang-rong. Quantum-inspired immune clonal algorithm for global optimization [J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2008, 38(5): 1234-1253.

共引文献3

同被引文献5

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部