G. Florin, R. Gómez and I. Lavallée

Abstract

     Designers of distibuted algorithms must deal with a variety of issues including sequential algorithms design, communication protocols, fault tolerance. The distibuted design must also include a proof step of the whole algorithm features. This paper gives a new scheme for the design of distibuted algorithms. In this approach the design step is performed simultaneously with the proof step. Our distibuted design method is mainly based on parallel recursive schemes, but recursivity is used in a distibuted environment, so we use two existing and widely available tools: remote procedure call, and the PAR instruction parallel execution of threads.