期刊文献+

基于动态粒子群算法的工作流服务主体优选方法 被引量:1

Optimization Method of Workflow Service Subject Based on Dynamic Particle Swarm Algorithm
下载PDF
导出
摘要 在研究工作流服务时间-费用双重优化问题的基础上,提出一种基于动态粒子群算法的工作流服务主体优选方法。通过区域划分,在每个粒子所在区域内,当适应值小于最佳适应值时,对区域重新进行初始化,从而使算法具有更强的全局收敛性和动态的自适应性;同时引入随机扰动、回退等算子,将搜索范围扩大到整个解空间以大大提高获得最优解的概率。结合动态粒子群算法建立工作流调度问题的目标模型,并从跨时间粒度、跨时区、跨工作时间3个方面对工作流服务主体优选方法进行了讨论分析。实验结果表明,该方法比其他应用工作流调度的算法具有更短的执行时间和费用,具有更高的效率、更好的优越性。 Research on workflow business hours-cost optimization problem.This paper proposed a novel dynamic particle swarm algorithm optimization method of workflow service subject.Through regional division,in each of the particles located in the region,when adapting to a value less than the best fitness,reinitializes region,so that the algorithm has better global convergence and dynamic adaptability,while the introduction of random disturbance,reverse operator,the search scope are expanded to the entire solution space in order to greatly improve the optimal solution probability.Combined with dynamic particle swarm algorithm based grid workflow scheduling problem of target model,and from three aspects of the cross time granularity,across time zones,the across working system,this paper discussed the workflow service subject selection method.The experimental results show that this method than other applications of grid workflow scheduling algorithm has shorter execution time and cost,higher efficiency,better superiority.
作者 陈鹏 何涛
出处 《计算机科学》 CSCD 北大核心 2012年第12期204-207,共4页 Computer Science
基金 国家自然科学基金项目(9140C1101061001)资助
关键词 动态粒子群 工作流 调度 遗传算法 Dynamic particle swarm Workflow Scheduling Genetic algorithm
  • 相关文献

参考文献9

  • 1De P, Dunne E J, Ghosh J B, et al. The discrete time-cost tradeoff problem revisited[J]. European Journal of Operational Research, 1995,81 (2) : 225-238.
  • 2Buyya R,Abramson D, Giddy J, et al. Economic models for re- source management and scheduling in grid computing[J]. Con- currency and Computation: Practice and Experience Journal (Special Issue on Grid Computing Environments), 2002,14 (13- 15):1507-1542.
  • 3Lin M, Lin Z X. A cost-effective critical path approach for ser- vice priority selections in grid computing economy[J]. Decision Support Systems, 2006,42(3) : 1628-1640.
  • 4Yu J, Buyya R, Tham C K. Cost-based scheduling of workflow applications on utility grids[C]//Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing. Mel- bourne, Australia, 2005.
  • 5郭文彩,杨扬.基于遗传算法的网格服务工作流调度的研究[J].计算机应用,2006,26(1):54-56. 被引量:12
  • 6Robinson J, Ragnat-Samii Y. Particle swarm optimization in e- lectromagnetics[J]. IEEE Transaction Antennas ProPag, 2004, 52(2) : 397-407.
  • 7Huang T, Mohan A S. A hybrid boundary condition for robust particle swarm optimization[J]. Antennas and Wireless Propa- gation Letters,2005,4(1) : 112-117.
  • 8Mikki S, Kishk. An improved particle swam optimization tech- nique using hard boundary conditions[J]. Microwave Opt Teeh- nol Lett Sep, 2005,46 (5) : 422-426.
  • 9Liu J X,Zhou C J. Researeh on the Workday Model in Business Service Grid Environment[C]//Proc. of the 2005 International Workshop on Workflow Management Systems in Grid Environ- ment. Changsha: IEEE Publisher, 2006.

二级参考文献11

  • 1GEIST GA, HEATH MT, PEYTON BW, eta/. A user's guide to PICL: a portable instrumented communications library[R]. Technical Report ORNL/TM-11616, Oak Ridge National Laboratory, Oak Ridge, Tennessee, 1992.
  • 2BHANDARI D, MURTHY CA, PAL SK. Genetic Algorithm with elitist model and its convergence[J]. Int. J. Pattern Recognition Artif. Intell, 1996, 10(6) :731 -747.
  • 3KREINOVICH V, QUINTANA C, FUENTES O. Genetic algorithms: What fitness scaling is optimal?[J]. Cybernetics and Systems, 1993, 24(1) : 9 - 26.
  • 4ABRAHAM A, BUYYA R. Nature's heuristics for scheduling jobs on computational grids[A]. The 8th Int'l Conf on Advanced Computing and Communication (ADCOM 2000)[C]. Cochin, India, 2000.
  • 5FOSTER I, KESSELMAN C, NICK J. et al. The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration, Globus Project[EB/OL]. http://www. globus. org/research/papers/ogsa. pdf.
  • 6VAN DER AALST W, VAN HEE K. Workflow Management Models, Methods, and Systems[M]. The MIT Press, 2004.
  • 7BUYYA R, ABRAMSON D, GIDDY J. An economy driven resource management architecture for global computational power grids[A]. Int'l Conf on Parallel and Distributed Processing Techniques and Applications[C]. Las Vegas, 2000.
  • 8FREY J, TANNENBAUM T, FOSTER I, et al, Condor-G: A computation management agent for multi institutional grids[J]. Cluster Computing, 2002, (5) : 237 - 246.
  • 9CHAPIN S, KARPOVICH J, GRIMSHAW A. The Legion resource management system[A]. In 5th Workshop on Job Scheduling Strategies for Parallel Processing[C]. 1999.
  • 10GOLDBERG DE. Genetic Algorithms in Search, Optimization 6 Machine Learning[M]. Addison-Wesley, Massachusetts, 1989.

共引文献11

同被引文献14

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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