On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion

Carole Delporte-Gallet,Hugues Fauconnier,Michel Raynal

doi:10.1007/978-3-030-15032-7_24

On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion

Carole Delporte-Gallet, Hugues Fauconnier + Show 1 more

https://doi.org/10.1007/978-3-030-15032-7_24

Copy DOI

Publication Date: Mar 15, 2019

Citations: 1

Affiliation: Délégation Paris 7, Université Paris Cité, Hong Kong Polytechnic University, University of Rennes, Institut de Recherche en Informatique et Systèmes Aléatoires

#Failure Detector #Message-passing Communication Model + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

Failure detectors are devices (objects) that provides the processes with information on failures. They were introduced to enrich asynchronous systems so that it becomes possible to solve problems (or implement concurrent objects) that are otherwise impossible to solve in pure asynchronous systems where processes are prone to crash failures. The most famous failure detector (which is called “eventual leader” and denoted \(\varOmega \)) is the weakest failure detector which allows consensus to be solved in n-process asynchronous systems where up to \(t=n-1\) processes may crash in the read/write communication model, and up to \(t<n/2\) processes may crash in the message-passing communication model.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.