Two Abstractions for Implementing Atomic Objects in Dynamic Systems

Friedman, Roy; Raynal, Michel; Travers, Corentin

doi:10.1007/11795490_8

Cited by 16 publications

(11 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the system should exhibit stable periods that last long enough. The following set definition captures this notion of stability [18,31]:…”

Section: Problem Definition and Additional Assumptionsmentioning

confidence: 99%

“…(Figure 2). On the reception of such a message, an MSS deterministically chooses an identity among the mobile processes it currently trusts and sends back this identity (lines [18][19][20][21][22].…”

Section: Description Of the Protocolmentioning

confidence: 99%

“…In recent years, a major advance in distributed computing is the development of dynamic systems [2,27,18,31], e.g. mobile computing systems and peerto-peer systems, where processes can join or leave the system at any time and the number of participating processes can change arbitrarily as time passes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Eventual Leadership in Dynamic Mobile Networking Environments

Cao

Raynal

Travers

et al. 2007

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)

Self Cite

View full text Add to dashboard Cite

Eventual leadership has been identified as a basic building block to solve synchronization or coordination problems in distributed computing systems. However, it is a challenging task to implement the eventual leadership facility, especially in dynamic distributed systems, where the global system structure is unknown to the processes and can vary over time. This paper studies the implementation of a leadership facility in infrastructured mobile networks, where an unbounded set of mobile hosts arbitrarily move in the area covered by fixed mobile support stations. Mobile hosts can crash and suffer from disconnections. We develop an eventual leadership protocol based on a time-free approach. The mobile support stations exchange queries and responses on behalf of mobile hosts. With assumptions on the message exchange flow, a correct mobile host is eventually elected as the unique leader. Since no time property is assumed on the communication channels, the proposed protocol is especially effective and efficient in mobile environments, where time-based properties are difficult to satisfy due to the dynamics of the network.13th IEEE International Symposium on Pacific Rim Dependable Computing 0-7695-3054-0/07 $25.00

show abstract

“…Therefore, the system should exhibit stable periods that last long enough. The following set definition captures this notion of stability [18,31]:…”

Section: Problem Definition and Additional Assumptionsmentioning

confidence: 99%

Section: Description Of the Protocolmentioning

confidence: 99%

See 1 more Smart Citation

The Eventual Leadership in Dynamic Mobile Networking Environments

Cao

Raynal

Travers

et al. 2007

13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Their solution also tolerates quorums on-line reconfigurations. Some quorum-based solutions have been also proposed to implement atomic objects in dynamic systems where participants may join, leave and crash during the computation, [8,18], [6].…”

Section: Related Workmentioning

confidence: 99%

Weakly-Persistent Causal Objects in Dynamic Distributed Systems

Baldoni

Malek

Milani

et al. 2006

2006 25th IEEE Symposium on Reliable Distributed Systems (SRDS'06)

View full text Add to dashboard Cite

show abstract

“…Coordinating the work of individual nodes in such decentralized topologies is however difficult, leading to a number of works that aim to provide fundamental coordination services such as consensus in systems whose size might be unknown, and in which participants only have a partial knowledge of each other [2,4,8,12,13,18].…”

Section: Introductionmentioning

confidence: 99%

Cliff-Edge Consensus: Agreeing on the Precipice

Taı̈ani

Porter

Coulson

et al. 2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

This paper presents a new form of consensus that allows nodes to agree locally on the extent of crashed regions in networks of arbitrary size. One key property of our algorithm is that it shows local complexity, i.e. its cost is independent of the size of the complete system, and only depends on the shape and extent of the crashed region to be agreed upon. In this paper, we motivate the need for such an algorithm, formally define this new consensus problem, propose a fault-tolerant solution, and prove its correctness.

show abstract

Two Abstractions for Implementing Atomic Objects in Dynamic Systems

Cited by 16 publications

References 22 publications

The Eventual Leadership in Dynamic Mobile Networking Environments

The Eventual Leadership in Dynamic Mobile Networking Environments

Weakly-Persistent Causal Objects in Dynamic Distributed Systems

Cliff-Edge Consensus: Agreeing on the Precipice

Contact Info

Product

Resources

About