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: | , , , , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg,
2010-01-29T18:51:35Z.
|
Subjects: | |
Online Access: | Get fulltext |