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...
Main Authors: | Kuznetsov, Petr (Author), Herlihy, Maurice (Author), Newport, Calvin Charles (Contributor), Lynch, Nancy Ann (Contributor), Guerraoui, Rachid (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg,
2010-01-29T18:51:35Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Of malicious motes and suspicious sensors
by: Gilbert, Seth, et al.
Published: (2015) -
Consensus and collision detectors in wireless ad hoc networks
by: Newport, Calvin (Calvin Charles)
Published: (2007) -
Interference-Resilient Information Exchange
by: Newport, Calvin Charles, et al.
Published: (2010) -
Asynchronous failure detectors
by: Cornejo Collado, Alex, et al.
Published: (2014) -
Modelling the algebra of weakest preconditions
by: Rewitzky, Ingrid Moira
Published: (2017)