Systematic building of a distributed recursive algorithm : example : the shortest path algorithm

G. Florin R. Gomez 1 Ivan Lavallee 1
1 ParaDis
INRIA Rocquencourt
Abstract : Designers of distributed algorithms must deal with a variety of issues including sequential algorithms design, communication protocols, fault tolerance. The distributed design must also include a proof step of the whole algorithm features. This paper gives a new scheme for the design of distributed algorithms. In this approach the design step is performed simultaneously with the proof step. Our distributed design method is mainly based upon parallel recursive schemes, but recursivity is used in a distributed environment so we use two existing and widely available tools : remote procedure call and the PAR instruction parallel execution of threads.
Type de document :
Rapport
[Research Report] RR-1902, INRIA. 1993
Liste complète des métadonnées

https://hal.inria.fr/inria-00074770
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 16:16:23
Dernière modification le : vendredi 16 septembre 2016 - 15:11:17
Document(s) archivé(s) le : mardi 12 avril 2011 - 19:17:23

Fichiers

Identifiants

  • HAL Id : inria-00074770, version 1

Collections

Citation

G. Florin, R. Gomez, Ivan Lavallee. Systematic building of a distributed recursive algorithm : example : the shortest path algorithm. [Research Report] RR-1902, INRIA. 1993. 〈inria-00074770〉

Partager

Métriques

Consultations de la notice

120

Téléchargements de fichiers

44