Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074770
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 4:16:23 PM
Last modification on : Thursday, February 11, 2021 - 2:50:07 PM
Long-term archiving on: : Tuesday, April 12, 2011 - 7:17:23 PM

Identifiers

  • 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⟩

Share

Metrics

Record views

131

Files downloads

62