Advertisement

Colored Ants for Distributed Simulations

  • Cyrille Bertelle
  • Antoine Dutot
  • Frédéric Guinand
  • Damien Olivier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3172)

Abstract

Complex system simulations can often be represented by an evolving graph which evolves with a one-to-one mapping between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. We use competing colonies of numerical ants, each depositing distinctly colored pheromones, to find clusters of highly communicating entities. Ants are attracted by communications and their own colored pheromones, while repulsion interactions between colonies allow to preserve a good distribution.

Keywords

Random Graph Processing Resource Dynamic Graph Edge Distribution Good Load Balance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Albert, R., Barabaśi, A.: Statistical mechanics of complex networks. Reviews of modern physics 74, 47–97 (2002)CrossRefMathSciNetzbMATHGoogle Scholar
  2. 2.
    Bokhari, S.H.: On the Mapping Problem. IEEE Transactions on Computers 30, 207–214 (1981)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Systems Man Cybernet. 26, 29–41 (1996)CrossRefGoogle Scholar
  4. 4.
    Eager, D.L., Lazowska, E.D., Zahorjan, J.: A comparison of receiver-initiated and sender-initiated adaptive load sharing. Performance evaluation 6, 53–68 (1986)CrossRefGoogle Scholar
  5. 5.
    Erdös, P., Rényi, A.: On random graphs. Pubiones Mathematicaelicat 6, 290–297 (1959)zbMATHGoogle Scholar
  6. 6.
    Faieta, B., Lumer, E.: Diversity and adaptation in populations of clustering ants. In: Simulation of Adaptive Behavior, pp. 501–508. MIT Press, Cambridge (1994)Google Scholar
  7. 7.
    Deneubourg, J.-L., Goss, S., Francks, N., Detrain, C., Chrétien, L.: The dynamics of collective sorting: Robot-like ants and ant-like robots. In: Simulation of Adaptive Behavior, pp. 356–363. MIT Press, Cambridge (1991)Google Scholar
  8. 8.
    Kuntz, P., Snyers, D.: Emergent colonization and graph partitionning. In: Simulation of Adaptive Behavior, pp. 494–500. MIT Press, Cambridge (1994)Google Scholar
  9. 9.
    Lin, F.C.H., Keller, R.M.: The gradient model load balancing method. IEEE TOSE 13, 32–38 (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Cyrille Bertelle
    • 1
  • Antoine Dutot
    • 1
  • Frédéric Guinand
    • 1
  • Damien Olivier
    • 1
  1. 1.LIHLe Havre

Personalised recommendations