期刊文献+

网格计算中一种改进的启发式任务调度算法 被引量:1

An Improved Heuristic Algorithm for Tasks Scheduling in the Grid Computing
下载PDF
导出
摘要 网格计算技术是20世纪90年代出现的新兴研究领域.网格系统由异构的资源组成.网格计算中,一个好的任务调度算法不但要考虑所有任务的makespan,使其值尽量小,同样要考虑到整个系统机器间的负载平衡问题.对异构计算环境下的元任务调度算法进行了分析,针对Min-min算法可能引发的负载不平衡问题,结合网格计算环境的特点,提出了一种适用于网格计算环境中的任务调度算法.
出处 《计算机研究与发展》 EI CSCD 北大核心 2006年第z2期52-55,共4页 Journal of Computer Research and Development
基金 河北省教育厅科研计划基金项目 河北大学自然科学基金项目(2005Q02)
  • 相关文献

参考文献8

  • 1[1]Lan Foster,Carl Kesselman.The Grid:Blueprint for a New Computing Infrastructure.Hardcover:Morgan Kaufmann,1998.279-309
  • 2查礼,徐志伟,林国璋,刘玉树,刘东华,李伟.基于LDAP的网格监控系统[J].计算机研究与发展,2002,39(8):930-936. 被引量:49
  • 3[3]O Ibarra,C Kim.Heuristic algorithm for scheduling independent tasks on nonidentical processors.Journal of the ACM,1977,77(2):280-289
  • 4[4]M Maheswaran,S Ali,H J Siegel,et al.Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems.The 8th IEEE Heterogeneous Computing Workshop (HCW'99),San Juan,Puerto Rico,1999
  • 5[5]Wu Min You,Shu Wei,Zhang Hong.Segmented Min-min:A static mapping algorithm for meta-tasks on heterogeneous computing systems.In:Proc of the 9th IEEE Heterogeneous Computing Workshop(HCW 2000).Los Alamitos,CA:IEEE Computer Society Press,2000.375-385
  • 6[6]M Maheswaran,S Ali,H J Siegel,et al.A comparison of dynamic strategies for mapping a class of independent tasks onto heterogeneous computing systems.School of Electrical and Computer Engineering,Purdue University,Tech Rep,1999
  • 7[7]A H Alhusaini,V K Prasanna,C S Raghavendra.A unified resource scheduling framework for heterogeneous computing environments.http://ipdps.cc.gatech.edu/1999/hcw/alhusain.pdf,2005-09-20
  • 8丁建立,陈增强,袁著祉.遗传算法与蚂蚁算法的融合[J].计算机研究与发展,2003,40(9):1351-1356. 被引量:287

二级参考文献18

  • 1[1]L Smarr, C Catlett. Metacomputing. Communications of the ACM, 1992, 35(6): 44~52
  • 2[2]Ian Foster, Carl Kesselman. The grid: Blueprint for a new computing infrastructure. San Francisco, CA: Morgan Kaufmann, 1999
  • 3[3]J Case, R Mundy, D Partain et al. Introduction to version 3 of the Internet-standard network management framework. IETF, RFC 2570, 1999. http://www.ietf.org/rfc/rfc2570.txt
  • 4[4]Rajkumar Buyya. PARMON: A portable and scalable monitoring system for clusters. Software-Practice and Experience, 2000, 30(7): 723~739
  • 5[5]P Uthayopas, S Phaisithbenchapol, K Chongbarirux. Building a resources monitoring system for SMILE Beowulf cluster. In: Proc of High Performance Computing, Asia'99. Singapore, 1999. http://prg.cpe.ku.ac.th/publications/hpcasia.pdf
  • 6[6]W Yeong, T Howes, S Kille. Lightweight directory access protocol. RFC 1777, 1995. http://www.ietf.org/rfc/rfc1777.txt
  • 7[7]S Fitzgerald, I Foster, C Kesselman et al. A directory service for configuring high-performance distributed computations. In: The 6th IEEE Int'l Symp on High Performance Distributed Computing. Portland, U S, 1997. 365~375
  • 8[8]B Tierney, B Crowley, D Gunter et al. A monitoring sensor management system for grid environment. In: The 9th Int'l Symp on High Performance Distributed Computing (HPDC-9 2000). Pittsburgh, Pennsylvania, 2000. 97~104
  • 9[9]Brian Tierney, Ruth Aydt, Dan Gunter et al. A Grid monitoring architecture. In: Performance Working Group of Grid Forum, 2001. http://www-didc.lbl.gov/GGF-PERF/GMA-WG/papers/GWD-GP-16-1.pdf
  • 10Marco Dorigo, Gambardella, Luca Maria. Ant colonies for the traveling salesman problem. Biosystems, 1997, 43(2): 73~81.

共引文献334

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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