Proceedings ArticleDOI
Recursive distributed programming schemes
G. Florin,R. Gomez,I. Lavallee +2 more
- pp 122-128
Reads0
Chats0
TLDR
Three kinds of recursive waves, a distributed programming scheme based on a procedure that calls n (or none) concurrent executions of itself, are defined and an example of a distributed recursive termination is presented.Abstract:
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. >read more
Citations
More filters
Journal ArticleDOI
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
TL;DR: This work presents a self-stabilized distributed algorithm based on homogeneous agents for constructing a random spanning tree, which makes use of distributed random walks as a network traversal scheme, in order to handle dynamic topology changes in ad hoc wireless networks.
Patent
Method of generating and storing and operating an user program consisting of instructions for a stored-program control unit
Heiko Kammler,Michael Schiessl +1 more
TL;DR: In this paper, the function code assigned to an output signal and the function parameters assigned to this function code are read first, depending on whether this refers to an input signal or to another instruction, either the input signal is stored temporarily or a branch is made to the other instruction and its function code and function parameters are executed.
Journal ArticleDOI
Online algorithms supporting emergence in distributed CAD systems
TL;DR: A CORBA model integrated with a Geometry Bus to support distributed virtual prototype whose variables can be defined in terms of ECGs as online algorithms supporting emergence in a network of reactive agents is presented.
Journal Article
Sur la structuration de deux systèmes complexes canards et processeurs.
TL;DR: Des canards aux processeurs, il n’y a qu’un battement d’ailes, and de plus, les canards produisent des magrets, foies gras et autres confits alors que l’ingestion de proceseurs estjusqu’à présent du moinsfortement déconseillée.
Journal Article
A new converge cast algorithm: application of procedural distributed recursive wave model and feedback function
TL;DR: A new converge cast algorithm that allows more control on the execution of the DRW depending on the application needs is presented, and can be applicable for collecting, not only for propaganda of information.
References
More filters
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Book ChapterDOI
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Journal ArticleDOI
A Distributed Algorithm for Minimum-Weight Spanning Trees
TL;DR: A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights that can be initiated spontaneously at any node or at any subset of nodes.
ReportDOI
A Distributed Algorithm for Minimum Weight Spanning Trees. Revision
TL;DR: In this paper, a distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights, where a processor exists at each node of the graph, knowing initially only the weights of the adjacent edges.
Journal ArticleDOI
Knowledge and common knowledge in a distributed environment
Joseph Y. Halpern,Yoram Moses +1 more
TL;DR: It is shown that states of knowledge of groups of processors are useful concepts for the design and analysis of distributed protocols and that, formally speaking, in practical systems common knowledge cannot be attained.