A taxonomy of distributed termination detection algorithms
An important problem in the field of distributed systems is that of detecting the termination of
a distributed computation. Distributed termination detection (DTD) is a difficult problem due …
a distributed computation. Distributed termination detection (DTD) is a difficult problem due …
The event heap: A coordination infrastructure for interactive workspaces
B Johanson, A Fox - Proceedings fourth IEEE workshop on …, 2002 - ieeexplore.ieee.org
Coordinating the interactions of applications running on the diversity of both mobile and
embedded devices that will be common in ubiquitous computing environments is still a …
embedded devices that will be common in ubiquitous computing environments is still a …
Termination detection for dynamically distributed systems with non-first-in-first-out communication
TH Lai - Journal of Parallel and Distributed computing, 1986 - Elsevier
We propose a new algorithm for detecting termination of distributed systems. The algorithm
works correctly whether the system is static or dynamic, whether the interprocess …
works correctly whether the system is static or dynamic, whether the interprocess …
Local computations in graphs: the case of cellular edge local computations
J Chalopin, Y Métivier, W Zielonka - Fundamenta Informaticae, 2006 - content.iospress.com
We examine the power and limitations of the weakest vertex relabelling system which allows
to change a label of a vertex in function of its own label and of the label of one of its …
to change a label of a vertex in function of its own label and of the label of one of its …
Synchronized distributed termination
B Szymanski, Y Shi, NS Prywes - IEEE Transactions on …, 1985 - ieeexplore.ieee.org
An efficient decentralized algorithm for synchronized termination of a distributed
computation is presented. It is assumed that distributed processes are connected via …
computation is presented. It is assumed that distributed processes are connected via …
An efficient message passing election algorithm based on Mazurkiewicz's algorithm
J Chalopin, Y Métivier - Fundamenta Informaticae, 2007 - content.iospress.com
We study the election and the naming problems in the asynchronous message passing
model. We present a necessary condition based on Angluin's lifting lemma [1] that must be …
model. We present a necessary condition based on Angluin's lifting lemma [1] that must be …
A unified framework for designing, implementing and visualizing distributed algorithms
M Bauderon, M Mosbah - Electronic Notes in Theoretical Computer Science, 2003 - Elsevier
We present a general method and a toolkit for designing, implementing and visualizing
distributed algorithms. We make use of the high level encoding of distributed algorithms as …
distributed algorithms. We make use of the high level encoding of distributed algorithms as …
Fast distributed computation of distances in networks
PS Almeida, C Baquero… - 2012 IEEE 51st IEEE …, 2012 - ieeexplore.ieee.org
This paper presents a distributed algorithm to simultaneously compute the diameter, radius
and node eccentricity in all nodes of a synchronous network. Such topological information …
and node eccentricity in all nodes of a synchronous network. Such topological information …
Call-by-Value λ-Graph Rewriting Without Rewriting
M Fernández, I Mackie - International Conference on Graph …, 2002 - Springer
Abstract Girard's Geometry of Interaction offers a low-level decomposition of the cut-
elimination process in linear logic, which can be used as a compilation technique for …
elimination process in linear logic, which can be used as a compilation technique for …
Election, naming and cellular edge local computations
J Chalopin, Y Métivier, W Zielonka - International Conference on Graph …, 2004 - Springer
We examine the power and limitations of the weakest vertex relabelling system which allows
to change a label of a vertex in function of its own label and of the label of one of its …
to change a label of a vertex in function of its own label and of the label of one of its …