Recoverable Mutual Exclusion [electronic resource] /
by Sahil Dhoked, Wojciech Golab, Neeraj Mittal.
- 1st ed. 2023.
- XV, 126 p. 60 illus., 16 illus. in color. online resource.
- Synthesis Lectures on Distributed Computing Theory, 2155-1634 .
- Synthesis Lectures on Distributed Computing Theory, .
Introduction -- Persistent Memory -- Prior Work -- Problem Formulation -- Load and Store based Algorithms -- Sublogarithmic Algorithms -- Adaptive Algorithms -- Constant Amortized Complexity Algorithm -- Abortable Recoverable Mutual Exclusion -- Tight Lower Bound -- System Wide Failures -- Discussion and Open Problems.
This book discusses the recent research work on designing efficient fault-tolerant synchronization mechanisms for concurrent processes using the relatively new persistent memory technology that combines the low latency benefits of DRAM with the persistence of magnetic disks. The authors include all of the major contributions published to date, and also convey some perspective regarding how the problem itself is evolving. The results are described at a high level to enable readers to gain a quick and thorough understanding of the RME problem and its nuances, as well as various solutions that have been designed to solve the problem under a variety of important conditions and how they compare to each other.
9783031200021
10.1007/978-3-031-20002-1 doi
Computer storage devices. Memory management (Computer science). Application software. Computer science. Software engineering. Computer science--Mathematics. Algorithms. Computer Memory Structure. Computer and Information Systems Applications. Computer Science. Software Engineering. Mathematical Applications in Computer Science. Algorithms.