Name
Abstract | ||
|---|---|---|
A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings 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. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-39964-3_80 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
ant algorithms,dynamic graph,clustering,auto-organization,distributed applications | Colored,Load balancing (computing),Computer science,Self-organization,Minification,Minimisation (psychology),Distributed algorithm,Ant colony,Cluster analysis,Distributed computing | Conference |
Volume | ISSN | Citations |
2888 | 0302-9743 | 2 |
PageRank | References | Authors |
0.49 | 3 | 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 |