The Weakest Failure Detectors to Boost Obstruction-Freedom

DOI10.1007/11864219_28zbMath1155.68331OpenAlexW2110170386MaRDI QIDQ3524321

Michał Kapałka, Petr Kuznetsov, Rachid Guerraoui

Publication date: 9 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/316445/files/446_2007_Article_46.pdf

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values ⋮ Communication-optimal eventually perfect failure detection in partially synchronous systems ⋮ Wait-Free Dining Under Eventual Weak Exclusion

This page was built for publication: The Weakest Failure Detectors to Boost Obstruction-Freedom