Mutual exclusion in asynchronous systems with failure detectors
From MaRDI portal
Publication:2485157
DOI10.1016/j.jpdc.2004.11.008zbMath1101.68380OpenAlexW2076907329MaRDI QIDQ2485157
Rachid Guerraoui, Petr Kuznetsov, Hugues Fauconnier, Carole Delporte-Gallet
Publication date: 3 August 2005
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/52448/files/IC_TECH_REPORT_200227.pdf
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
On the weakest failure detector ever ⋮ Failure detectors encapsulate fairness ⋮ About informatics, distributed computing, and our job: a personal view ⋮ The minimum information about failures for solving non-local tasks in message-passing systems ⋮ Wait-Free Dining Under Eventual Weak Exclusion ⋮ Wait-freedom with advice
This page was built for publication: Mutual exclusion in asynchronous systems with failure detectors