Colored Ants for Distributed Simulations
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.
KeywordsRandom Graph Processing Resource Dynamic Graph Edge Distribution Good Load Balance
Unable to display preview. Download preview PDF.
- 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.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.Kuntz, P., Snyers, D.: Emergent colonization and graph partitionning. In: Simulation of Adaptive Behavior, pp. 494–500. MIT Press, Cambridge (1994)Google Scholar
- 9.Lin, F.C.H., Keller, R.M.: The gradient model load balancing method. IEEE TOSE 13, 32–38 (1987)Google Scholar