期刊文献+

一种动态网格Overlay Network拓扑优化蚁群算法 被引量:1

A Dynamic Grid Overlay Network Topology Optimization Ant Colony Algorithm
下载PDF
导出
摘要 如何提供丰富的通信交互是高级网格应用的关键问题,但是目前的网格技术还不能满足这一需求,提出了一种基于Overlay Network的网格架构来弥补这一不足,如何优化Overlay Network拓扑结构是该架构必须首先解决的重要问题,给出了一种动态环境中拉各朗日蚁群优化算法DLagrAnt,计算的结果显示该算法具有更快的适应性和更小的开销。 Provision rich diversity of communication interaction is a key issue in advanced grid applications, But this is not addressed by present-delay grid, this paper proposes a grid architecture built on overlay network to address this particular deficiency. Overlay network topology optimization for a set of node processors is a central problem of grid computing. Then a dynamic grid overlay network topology Lagrangean optimization ant colony algorithm (DLagrAnt) is given in dynamic environment, and the computational results illustrate a fast adaptation and a little cost are achieved.
出处 《计算机工程》 CAS CSCD 北大核心 2006年第5期41-42,54,共3页 Computer Engineering
基金 高等学校博士学科点专项科研基金资助项目(20030290003)
关键词 网格架构 OVERLAY network 拓扑优化 蚁群算法 Grid architecture Overlay network Topology optimization Ant colony algorithm
  • 相关文献

参考文献6

  • 1Czajkowski K,Foster I,Karonis N,et al.A Resource Management Architecture for Metacomputing Systems[C].Proc.of Workshop on Job Scheduling Strategies for Parallel Processing,Springer-Verlag,1998:62-82.
  • 2Smith P,Simpson S,Hutchison D.Peer-to-Peer Networking for Discovering Programmable Resources[C].Proc.of 4th Intl.Workshop on Networked Group Communication,Boston,2002:120-126.
  • 3Pallickara S,Fox G.Narada Brokering:A Distributed Middleware Framework and Architecture for Enabling Durable Peer-to-Peer Grids[C].Proc.of IFIP/ACM/USENIX Middleware 03,Rio de Janeiro,Brazil,2003:200-203.
  • 4Saroiu S,Gummadi P K,Gribble S D.A Measurement STudy of Peer-to-peer Sharing Systems[C].Proceedings of Multimedia Computing and Networking 2002,San Jose,CA,2002:88-92.
  • 5Nouyan S.Agent-based Approach to Dynamic Task Allocation[C].Ant Algorithms:Third International Workshop,ANTS,Volume 2463 / 2002 of Lecture Notes in Computer Science.Springer-Verlag,Heidelberg,2002:221-226.
  • 6Louren_co H,Serra D.Adaptive Search Heuristics for the Generalized Assignment Problem[J].Mathware and Soft Computing,2002,9(2-3):209-234.

同被引文献4

  • 1Cela E.The quadratic assignment problem[M].[S.l.]:Kluwer Academic Publishers, 1998.
  • 2Burkard R E,Rendl F.A thermodynamically motivated simulation procedure for combinatorial optimization problems [J].European Journal of Operational Research, 1983,17: 169-214.
  • 3Kirkpatric S,Gelatt C,Vecchi M.Optimization by simulated annealing[J].Science, 1983,220 : 291-307.
  • 4Sofianopoulou S.Simulated annealing applied to the process allocation problem[J].European Journal of Operational Research, 1992,60: 327-334.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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