Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-28646-2_31 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
clus- tering,self-organization,dynamic interaction graph,load balancing .,colored ant algorithms,distributed simulation,load balance,self organization,scale free | Cluster (physics),Colored,Random graph,Vertex (geometry),Computer science,Load balancing (computing),Swarm intelligence,Minimisation (psychology),Distributed computing | Conference |
Volume | ISSN | Citations |
3172 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cyrille Bertelle | 1 | 81 | 20.42 |
| Antoine Dutot | 2 | 20 | 4.53 |
| F. Guinand | 3 | 189 | 25.84 |
| Damien Olivier | 4 | 42 | 6.95 |