期刊文献+

基于Min-Min和蚁群算法的网格任务调度方法

A Grid Task Scheduling Method Based on Min-Min and ACO Algorithm
下载PDF
导出
摘要 网格任务调度是网格计算的研究热点,也是一个NP难问题。文章结合Min-Min算法和蚁群算法的优点,提出了一种基于Min-Min蚁群算法(MMACO)的任务调度方法。仿真实验表明:在网格环境下,该算法具有较好的全局最优求解能力和较快的收敛速度。 Grid task scheduling is a hot topic of grid computing and is also a NP hard problem. Combining Min-Min algorithm and the advantages of ant colony algorithm, this paper proposes a task scheduling method based on Min-Min ant colony algorithm (MIMACA). Simulation results show that: in the grid environment, the algorithm has better capacity of searching global optimal solution and a faster convergence rate.
出处 《计算机时代》 2009年第7期50-52,共3页 Computer Era
基金 江西省研究生创新专项基金项目(YC08B029)
关键词 网格 任务调度 Min—Min 蚁群算法 grid task scheduling Min-Min ACO
  • 相关文献

参考文献5

  • 1魏天宇,曾文华,黄宝边.基于Min-Min改进后的网格调度算法[J].计算机应用,2005,25(5):1190-1192. 被引量:32
  • 2Stutzle T,Dorigo M.A short convergence proof for a class of antcolony optimization algorithms[J].IEEF. Transactions on Evolutionary Computation,2002.6(4):358- 365.
  • 3Ripeanu M and Foster I.M apping the Gnutella network[C].lst Intemational Workshop on Peer-to Peer Systems (IPTPS'02), Cambridge Massachusetts, in Lecture Notes in Computer Science 2429,Springer March 2002:85-93.
  • 4Project JXTA.An Open Innovative Collaboration[J].http://www. jxta.org/project/www/docs/Openlnnovative.pdf.
  • 5BUYYA R,MURSHEDM.GridSim:a toolkit for the modeling,and simulation of distributed resource management,and scheduling for grid computing[J].Concurrency and Computation,2002.14: 1175-1220.

二级参考文献9

  • 1MAHESWARAN M, ALI S, SIEGEL HJ,et al. Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems[A]. Proceedings of the 8th IEEE Heterogeneous Computing Workshop (HCW'99)[C]. IEEE Computer Society Press, 1999. 30-44.
  • 2RITCHIE G, LEVINE J. A Fast, Effective Local Search for Scheduling Independent Jobs in Heterogeneous Computing Enviroments[A]. Proceedings of the 22nd Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG 2003) [C]. 2003.
  • 3WOLSKI R, SPRING N, HAYES J. The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing[J]. Journal of Future Generation Computing Systems, October, 1999, 15(5-6): 757-768.
  • 4BHARADWAJ V, GHOSE D, ROBERTAZZI TG. Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems[J]. Cluster Comput., 2003, 6(1):7-17.
  • 5XIAOSHAN HE, SUN XH. VON LASZEWSKI G.QoS Guided Min-Min Heuristic for Grid Task Scheduling[J].Journal of Coputer Science & Technology,2003,(5):442-451.
  • 6CASANOVA H. Simgrid: A Toolkit for the Simulation of Application Scheduling[A]. Proceedings of the 1st International Symposium on Cluster Computing and the Grid[C]. 2001.430.
  • 7FOSTER I, KESSELMAN C. The Grid, Blueprint for a New Computing Infrastructure[R]. San Francisco: Morgan Kaufmann Publishers Inc., 1998. 279-309.
  • 8BRAUN TD, SIEGEL HJ, BECK N.A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems[J].Journal of Parallel and Distributed Computing,2001,61(1):810-837.
  • 9ARMSTRONG R, HENSGEN D, KIDD T.The Relative Performance of Various Mapping Algorithm is Independent of Sizable Variance in Run-time Predictions[A]. Proceedings of the 7th Heterogeneous Computing Workshop (HCW'98)[C]. IEEE Computer Society Press,1998.79-87.

共引文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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