The derivation of distributed termination detection algorithms from garbage collection schemes

Tel, Gérard; Mattern, Friedemann

doi:10.1007/bfb0035101

Cited by 19 publications

(21 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have observed [22] that the task of clearing routing tables is equivalent to the distributed termination problem [25]. A forwarding endpoint is allowed to be cleared if it can be proved that no other platform will ever forward method calls to it.…”

Section: Clearing Routing Informationmentioning

confidence: 99%

“…A forwarding endpoint is allowed to be cleared if it can be proved that no other platform will ever forward method calls to it. This may be implemented using a distributed reference counting algorithm [23,25]. In particular, RMI provides a method Unreferenced for remote objects which is called when there is no remote reference to this object [12].…”

Section: Clearing Routing Informationmentioning

confidence: 99%

See 1 more Smart Citation

Mobile Objects in Java

Moreau

Ribbens

2002

Scientific Programming

View full text Add to dashboard Cite

Abstract:Mobile Objects in Java provides support for object mobility in Java. Similarly to the RMI technique, a notion of client-side stub, called startpoint, is used to communicate transparently with a server-side stub, called endpoint. Objects and associated endpoints are allowed to migrate. Our approach takes care of routing method calls using an algorithm that we studied in [22]. The purpose of this paper is to present and evaluate the implementation of this algorithm in Java. In particular, two different strategies for routing method invocations are investigated, namely call forwarding and referrals. The result of our experimentation shows that the latter can be more efficient by up to 19%.

show abstract

Section: Clearing Routing Informationmentioning

confidence: 99%

Section: Clearing Routing Informationmentioning

confidence: 99%

Mobile Objects in Java

Moreau

Ribbens

2002

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…Properties such as deadlock [Obermarck 1982] and termination [Tel and Mattern 1993] can be expressed as predicates over the state of distributed processes. The complete state of the distributed system can then be gathered and evaluated, to determine if the predicate is true.…”

Section: Introductionmentioning

confidence: 99%

Detecting Locally Distributed Predicates

Rosa

Goldstein

Lee

et al. 2011

ACM Trans. Auton. Adapt. Syst.

View full text Add to dashboard Cite

In this paper, we formalize locally distributed predicates, a concept previously introduced to address specific challenges associated with modular robotics and distributed debugging. A locally distributed predicate (LDP) is a novel construction for representing and detecting distributed properties in sparse-topology systems. Previous work on LDPs presented empirical validation; here we show a formal model for two variants of the LDP algorithm, LDP-Basic and LDP-Snapshot, and establish performance bounds for these variants. We prove that LDP-Basic can detect strong stable predicates, that LDP-Snapshot can detect all stable predicates, and discuss their applicability to various distributed programming domains and to spatial computing in general. LDP detection in bounded-degree networks is shown to be scale-free, making the approach particularly attractive for specific topologies even though LDPs are less efficient than snapshot algorithms in general distributed systems.

show abstract

“…The problem of distributed termination detection (DTD), as it is often called, is a fundamental one in parallel and distributed computing, with close relationships to other important problems such as deadlock detection, garbage collection, snapshot computation, and global virtual time approximation [36,24]. The model of the computing system used is the same as that in previous work [4] and basically consists of an asynchronous network of P reliable processing elements (PEs) labeled 0, 1, .…”

Section: Introductionmentioning

confidence: 99%