Dining philosophers with crash locality 1

Pike, Scott M.; Sivilotti, Paolo A. G.

doi:10.1109/icdcs.2004.1281564

Cited by 16 publications

(12 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The popularity of ♦S and ♦P is not just incidental. Despite apparently weak guarantees on crash fault detection, ♦S has been shown to solve consensus and other related problems [10,11], and ♦P has been shown to solve problems including dining philosophers [35,36], stable leader election [2], quiescent reliable communication [1], and contention management [25].…”

Section: Related Workmentioning

confidence: 99%

Failure Detectors Encapsulate Fairness

Pike

Sastry

Welch

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Failure detectors have long been viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsulated by a given failure detector have met with limited success. The reason for this is that traditionally, models of partial synchrony are specified with respect to real time, but failure detectors do not encapsulate real time. Instead, we argue that failure detectors encapsulate the fairness in computation and communication. Fairness is a measure of the number of steps executed by one process relative either to the number of steps taken by another process or relative to the duration for which a message is in transit. We argue that failure detectors are substitutable for the fairness properties (rather than real-time properties) of partially synchronous systems. We propose four fairness-based models of partial synchrony and demonstrate that they are, in fact, the 'weakest system models' to implement the canonical failure detectors from the Chandra-Toueg hierarchy. We also propose a set of fairness-based models which encapsulate the G c parametric failure detectors which eventually and permanently suspect crashed processes, and eventually and permanently trust some fixed set of c correct processes.

show abstract

Section: Related Workmentioning

confidence: 99%

Failure Detectors Encapsulate Fairness

Pike

Sastry

Welch

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…In [42], Pike and Sivilotti propose a transformation of the hygienic algorithm to reduce the failure locality to 1 (Fig. 10).…”

Section: Case Study Example: Resource Allocation Using Dining Philosomentioning

confidence: 99%

“…10. Hygienic dining philosopher algorithm, transformed to tolerate crashes (adapted from [42]). are roughly the same, then the total number of messages sent out in the entire network is Oðn · dÞ for each round of leases.…”

Section: Message Complexitymentioning

confidence: 99%

Failure detectors for wireless sensor-actuator systems

2009

View full text Add to dashboard Cite

“…The failure detector 3P is sufficiently powerful to solve many classic problems in distributed computing, including fault tolerant consensus [5], stable leader election [2], quiescent reliable communication [1], waitfree contention management [14], crash-locality-1 dining philosophers [20], and wait-free dining under eventual weak exclusion [21].…”

Section: Introductionmentioning

confidence: 99%

Crash fault detection in celerating environments

Sastry

Pike

Welch

2009

2009 IEEE International Symposium on Parallel &Amp; Distributed Processing

View full text Add to dashboard Cite

Failure detectors are a service that provides (approximate) information about process crashes in a distributed system. The well-known "eventually perfect" failure detector, 3P, has been implemented in partially synchronous systems with unknown upper bounds on message delay and relative process speeds. However, previous implementations have overlooked an important subtlety with respect to measuring the passage of time in "celerating" environments, in which absolute process speeds can continually increase or decrease while maintaining bounds on relative process speeds. Existing implementations either use action clocks, which fail in accelerating environments, or use real-time clocks, which fail in decelerating environments. We propose the use of bichronal clocks, which are a composition of action clocks and real-time clocks. Our solution can be readily adopted to make existing implementations of 3P robust to process celeration, which can result from hardware upgrades, server overloads, denial-of-service attacks, and other system volatilities.

show abstract

Dining philosophers with crash locality 1

Cited by 16 publications

References 15 publications

Failure Detectors Encapsulate Fairness

Failure Detectors Encapsulate Fairness

Failure detectors for wireless sensor-actuator systems

Crash fault detection in celerating environments

Contact Info

Product

Resources

About