Join us for our Virtual Brown Bag Research Series featuring Srikanth Sastry from MIT.
Failure detectors --- oracles that provide information about process crashes --- are an important abstraction for crash tolerance in distributed systems. Although current failure-detector theory provides great generality and expressiveness, it also poses significant challenges in developing a robust hierarchy of failure detectors. In this talk, we address some of these challenges by proposing a variant of failure detectors called asynchronous failure detectors and an associated modeling framework. Unlike the traditional failure-detector framework, our framework eschews real time completely. We show that asynchronous failure detectors are sufficiently expressive to include several popular failure detectors. Additionally, we show that asynchronous failure detectors satisfy many desirable properties: they are self-implementable, guarantee that stronger asynchronous failure detectors solve more problems, and ensure that their outputs encode no information other than process crashes. We introduce the notion of a failure detector being representative of a problem to capture the idea that some problems encode the same information about process crashes as their weakest failure detectors do. We show that a large class of problems, called bounded problems, do not have representative failure detectors.
The background paper: Alejandro Cornejo, Nancy Lynch, and Srikanth
Sastry, "Asynchronous Failure Detectors". In: Proceedings of the 2012
ACM symposium on Principles of distributed computing (PODC 2012). pp
243--252. DOI: http://dx.doi.org/10.1145/2332432.2332482