Distributed Systems

Concurrency and Consistency

By: Matthieu Perrin

Write A Review

eText | 25 March 2017 | Edition Number 1

At a Glance

Format
ePUB

eText

$117.95

or 4 interest-free payments of $29.49 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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