On the Fly PSO Inspired Algorithm For Graph Distribution

Djamel Eddine Saïdouni (1) , Ahmed Chawki Chaouche (2) , Jean-Michel Ilié (3)

1 MISC - Modélisation et d'Implémentation des Systèmes Complexes [Constantine]
2 SMA - Systèmes Multi-Agents
3 MoVe - Modélisation et Vérification

This paper deals with clustering applications, it proposes an on the fly algorithm for distributing graphs. The proposed algorithm is based on the meta-heuristic "Particle Swarm Optimization (PSO)". For the sake of presentation, the idea of adapting the PSO algorithm for graphs distribution is developed firstly by assuming that the graph is already generated. After that a distributed algorithm is proposed for concurrently generating and distributing graphs. This distribution should ensure the workload balancing property and the minimization of the number of distributed inter-site edges.

Mots clés: Distributed algorithms; Distributed system; PSO; Graphs distribution

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Informatique ubiquitaire

Djamel Eddine Saïdouni, Ahmed Chawki Chaouche, Jean-Michel Ilié. On the Fly PSO Inspired Algorithm For Graph Distribution. 2nd International Symposium on Modelling and Implementation of Complex Systems, May 2012, Constantine, Algeria. pp.156-163, ⟨10.1016/j.procs.2013.09.022⟩. ⟨hal-00731766⟩