The Weakest Failure Detector for Wait-Free, Eventually Fair Mutual Exclusion

@inproceedings{Song2007TheWF,
  title={The Weakest Failure Detector for Wait-Free, Eventually Fair Mutual Exclusion},
  author={Yantao Song and Scott M. Pike and Srikanth Sastry},
  year={2007}
}
We establish the necessary conditions for solving wait-free, eventually fair mutual exclusion in message-passing environments subject to crash faults. Wait-freedom guarantees that every correct hungry process eventually enters its critical section. Eventual fairness guarantees that every run has an infinite suffix during which no correct hungry process is overtaken more than b times. Previously, we showed that the eventually perfect failure detector (3P) is sufficient to solve wait-free… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…