Co-ordination in intelligent ant-based application service mapping in grid environments

被引:0
作者
Musunoori, Sharath Babu [1 ]
Horn, Geir [1 ,2 ]
机构
[1] SIMULA Res Lab, POB 134, N-1325 Lysaker, Norway
[2] SINTEF ICT, N-0314 Oslo, Norway
来源
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM | 2007年
关键词
service configuration; mapping; partitioning; learning automata;
D O I
10.1109/SIS.2007.367952
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A key problem of component-based grid application configuration is to map services onto the execution nodes of the grid environment such that all services of the application satisfy some minimum, quality requirements. This problem is known to be NP-hard. This paper presents two extensions to our previous ant-based application service mapping heuristic, in order to establish some coordination among the working agents in a decentralized environment and improve its convergence rate. The first extension proposes to use gatekeepers that learn to guide the movement of intelligent foraging ants. The second extension is a coordination mechanism to allow an ant to draw on the learned knowledge of its co-workers. The simulation evaluation of the proposed extensions shows that inclusion of scaled sleep time further improves the convergence rates while the gatekeepers seem to have a negative effect.
引用
收藏
页码:303 / +
页数:2
相关论文
共 9 条
  • [1] Ant system: Optimization by a colony of cooperating agents
    Dorigo, M
    Maniezzo, V
    Colorni, A
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01): : 29 - 41
  • [2] Gannon D., 2002, J CLUSTER COMPUT JUL
  • [3] Horn G., 2005, P 19 IEEE INT PAR DI, p297b
  • [4] MUSUNOORI S, 2005, P 17 INT C PAR DISTR
  • [5] MUSUNOORI SB, 2006, 6 INT C INT SYST DES
  • [6] MUSUNOORI SB, 2006, IEEE C EV COMP CEC 2
  • [7] Narendra K. S., 1989, LEARNING AUTOMATA IN
  • [8] DETERMINISTIC LEARNING AUTOMATA SOLUTIONS TO THE EQUIPARTITIONING PROBLEM
    OOMMEN, BJ
    MA, DCY
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (01) : 2 - 13
  • [9] Press W.H., 2002, NUMERICAL RECIPES C, V2nd ed