Abstract
This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes failure detectors that provide information about global time but includes all known meaningful failure detectors such as ◇S, ◇P and P [2]. We show that, within A, the weakest failure detector for NBAC is ?P + ◇ OS.
| Original language | English |
|---|---|
| Pages (from-to) | 461-473 |
| Number of pages | 13 |
| Journal | IFIP Advances in Information and Communication Technology |
| Volume | 96 |
| DOIs | |
| Publication status | Published - 1 Jan 2002 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'On the weakest failure detector for non-blocking atomic commit'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver