Distributed Systems: Concurrency and Consistency explores the gray area of distributed systems and draws a map of weak consistency criteria, identifying several families and demonstrating how these may be implemented into a programming language. Unlike their sequential counterparts, distributed systems are much more difficult to design, and are therefore prone to problems. On a large scale, usability reminiscent of sequential consistency, which would provide the same global view to all users, is very expensive or impossible to achieve. This book investigates the best ways to specify the objects that are still possible to implement in these systems.
- Explores the gray area of distributed systems and draws a map of weak consistency criteria
- Investigates the best ways to specify the objects that are still possible to implement in these systems
- Presents a description of existing memory models and consistency criteria
|Product dimensions:||6.00(w) x 9.00(h) x (d)|
About the Author
Matthieu Perrin is a researcher whose interests are primarily focused on distributed systems modeling. This book is based on work carried out for his PhD thesis at the University of Nantes in France.
Table of Contents
1. Specification of Shared Objects 2. Overview of Existing Models 3. Update Consistency 4. Causal Consistency 5. Weak Consistency Space 6. CODS Library