Client Centric Consistency Models

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 11

Client Centric Consistency models

Dushyanth S
1SI19SCN04
Client-centric consistency models
The previously studied consistency models concern
themselves with maintaining a consistent (globally
accessible) data-store in the presence of concurrent
read/write operations.

Another class of distributed data store is that which is


characterized by the lack of simultaneous updates.
Here, the emphasis is more on maintaining a consistent
view of things for the individual client process that is
currently operating on the data-store.
Client centric consistency
In many cases concurrency appears only in restricted
form.

 In many applications most processes only read data.

 Some degrees of inconsistency can be tolerate.

 In some cases if for a long time no update takes place


all replicas gradually become consistent.
Provide guarantees about ordering of operations only
for a single client, i.e.
a) Effects of an operations depend on the client
performing it.
b) Effects also depend on the history of client’s
operations.
c) Applied only when requested by the client.
d) No guarantees concerning concurrent accesses by
different clients.

Assumption:
 Clients can access different replicas, e.g. mobile users.
Eventual Consistency
Eventual consistency for replicated data is fine if clients
always access the same replica. Client centric
consistency provides consistency guarantees for a single
client with respect to the data stored by that client.

They have in common that if no updates take place for a


long time, all replicas will gradually become consistent.
This form of consistency is called eventual consistency.
Consistency and Replication
Client-Centric Consistency Models
Clients access distributed data store using, generally,
the local copy. Updates are eventually propagated to
other copies.
a) Monotonic read
b) Monotonic write
c) Read your writes
d) Writes follow reads
Monotonic Reading
Definition: A distributed data store provides
monotonic-read consistency if the following holds:

 If process P reads the value of data item x, any


successive read operation on x by that process will
always return the same value or a more recent
one(independently of the replica at location L where
this new read will be done).
Example Systems
Distributed e-mail database with distributed and
replicated user-mailboxes.

 Emails can be inserted at any location.

 However, updates are propagated in a lazy (i.e. on


demand) fashion.
Example
THANK YOU

You might also like