Abstract
This chapter presents the failure detector class (denoted Σ) that allows us to circumvent the impossibility of building an atomic read/write register in an asynchronous message-passing system in which half or more processes may commit crash failures (system model CAMPn,t[t ≥ n/2]). (The reader is referred to Section 3.3 for formal definitions related to failure detectors.) This chapter first introduces the class Σ, and shows how it allows us to implement an atomic register for any value of t. Then, it shows that Σ is the failure detector class that provides us with the weakest information on failures that allows an atomic read/write register to be built despite asynchrony and any number of process crashes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Raynal, M. (2018). Circumventing the t < n/2 Read/Write Register Impossibility: the Failure Detector Approach. In: Fault-Tolerant Message-Passing Distributed Systems. Springer, Cham. https://doi.org/10.1007/978-3-319-94141-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-94141-7_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94140-0
Online ISBN: 978-3-319-94141-7
eBook Packages: Computer ScienceComputer Science (R0)