On the weakest failure detector ever

On the weakest failure detector ever

Many problems in distributed computing are impossible to solve when no information about process failures is available. It is common to ask what information about failures is necessary and sufficient to circumvent some specific impossibility, e.g., consensus, atomic commit, mutual exclusion, etc. Th...

Full description

Bibliographic Details
Main Authors: Kuznetsov, Petr, Herlihy, Maurice, Newport, Calvin Charles, Lynch, Nancy Ann, Guerraoui, Rachid
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Springer Berlin Heidelberg 2010
Online Access:http://hdl.handle.net/1721.1/51039
https://orcid.org/0000-0003-3045-265X

Internet

http://hdl.handle.net/1721.1/51039
https://orcid.org/0000-0003-3045-265X

Similar Items