Bounded Concurrent Time-Stamping

International audienceA core abstraction for many distributed algorithms simulates shared memory [3]; this abstraction allows to take algorithms designed for shared memory, and port them to asynchronous message-passing systems, even in the presence of failures. There has been significant work on creating such simulations, under various types of permanent failures, as well as on exploiting this abstraction in order to derive algorithms for message-passing systems (see [2].

Section: Overview Of Our Simulationmentioning

confidence: 99%

Brief Announcement: Sharing Memory in a Self-stabilizing Manner

Alon

Attiya

Dubois

et al. 2010

“…Any two different interactions (even by the same client) are labeled with different κ. This labeling can be achieved using standard timestamping techniques [7,3]. We let K denote the set of all interaction instances.…”

Section: The Dhcpf Interfacementioning

confidence: 99%

The DHCP Failover Protocol: A Formal Perspective

Fan¹,

Droms

Griffeth

et al. 2007

Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorithm uses ideas from an algorithm presented in [5], but is considerably simpler and at the same time more structured and rigorous. We specify the assumptions and behavior of our algorithm as traces of Timed Input/Output Automata, and prove its correctness using this formalism. Our algorithm is based on a composition of independent subalgorithms solving variants of the classical leader election and shared register problems in distributed computing. The modularity of our algorithm facilitates its understanding and analysis, and can also aid in optimizing the algorithm or proving lower bounds. Our work demonstrates that formal methods can be feasibly applied to complex real-world problems to improve and simplify their solutions.

“…Unlike the Bakery algorithm (and ours), the algorithm in [1] is not symmetric: process p i only reads the values of the lower processes. It is possible to replace the unbounded timestamps of the Bakery algorithm (i.e., taking a number) with bounded timestamps, as defined in [22] and constructed in [16,17,20], however the resulting algorithm will be rather complex, when the price of implementing bounded timestamps is taken into account.…”

Section: Related Workmentioning

confidence: 99%

The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms

Taubenfeld¹

2004

Abstract. A mutual exclusion algorithm is presented that has four desired properties: (1) it satisfies FIFO fairness, (2) it satisfies localspinning, (3) it is adaptive, and (4) it uses finite number of bounded size atomic registers. No previously published algorithm satisfies all these properties. In fact, it is the first algorithm (using only atomic registers) which satisfies both FIFO and local-spinning, and it is the first bounded space algorithm which satisfies both FIFO and adaptivity. All the algorithms presented are based on Lamport's famous Bakery algorithm [27], which satisfies FIFO, but uses unbounded size registers (and does not satisfy local-spinning and is not adaptive). Using only one additional shared bit, we bound the amount of space required by the Bakery algorithm by coloring the tickets taken in the Bakery algorithm. The resulting Black-White Bakery algorithm preserves the simplicity and elegance of the original algorithm, satisfies FIFO and uses finite number of bounded size registers. Then, in a sequence of steps (which preserve simplicity and elegance) we modify the new algorithm so that it is also adaptive to point contention and satisfies local-spinning.