Recursive distributed programming schemes
暂无分享,去创建一个
Distributed recursive waves, a distributed programming scheme based on a procedure that calls n (or none) concurrent executions of itself, is defined. Three kinds of recursive waves (sequential, based on a tree, based on a flooding) and the example of a distributed recursive termination, respectively, are presented. Distributed recursive programming provides a natural style for writing distributed algorithms. It does not support the overhead drawback of the centralized computer recursivity. Solutions to distributed problems using the message passing wave approach or the distributed iteration scheme can also be expressed in the distributed recursive approach with the same message complexity.<<ETX>>
[1] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[2] Ernest J. H. Chang,et al. Echo Algorithms: Depth Parallel Operations on General Graphs , 1982, IEEE Transactions on Software Engineering.
[3] Ivan Lavallée,et al. A Fully Distributed (Minimal) Spanning Tree Algorithm , 1986, Inf. Process. Lett..
[4] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.