LIPN : OCAD

Page personnelle de Franck BUTELLE

Laboratoire d'Informatique de l'Université Paris Nord (LIPN)
Institut Galilée
Avenue J.B. Clément
93430 VILLETANEUSE
FRANCE
Bureau: A112. Tél.: ici
Fax : (33) 1 48 26 07 12

Page enseignement

Research Interests : Distributed asynchronous algorithms, more precisely spanning trees, routing, on-line scheduling, self-stabilization.
Sujets de Recherche : Algorithmique Distribuée en milieu asynchrone, plus particulièrement arbres couvrants, routage, ordonnancement en ligne, auto-stabilisation.

Some references

Real-Time Distributed Scheduling of Precedence Graphs on Arbitrary Wide Networks. Franck Butelle, Lucian Finta and Mourad Hakem Proc. of the 21st ACM/IEEE International Parallel \& Distributed Processing Symposium IPDPS March 26-30, 2007, Long Beach, California, USA.
The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs. Lélia Blin and Franck Butelle. IJFCS Vol. 15, No. 3 (2004) pp. 507-516.
A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree. Marc Bui, Franck Butelle, and Christian Lavault. JPDC Vol. 64, No. 5 (2004) pp. 571-577.
A New On-Line Scheduling Algorithm for Distributed Real-Time System. Mourad Hakem and Franck Butelle. Third International School and Symposium on Advanced Distributed Systems ISSADS 2004, Guadalajara, Mexico. LNCS, Springer Verlag, Vol. 3061, (2004) pp. 241-251.
More articles on Hyper Articles en Ligne (HAL) - CNRS & INRIA.

Logiciel

Participation à la reprise sous GPL du logiciel SCHUR (Programme interactif de calcul des propriétés des groupes de Lie et des fonctions symmétriques)

PGP public key