F1.5 Consistency Flashcards

1
Q

Why do we need consistency?

A

To keep replicas consistent, minimize conflicting operations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What this definition about? :
The result of any execution is the same as if the operations of all processes were executed in some sequential order rand the operations of each individual process appear in this sequence in the order specified by its program

A

Sequential consistency

RABA SEQ

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What’s this definition about?:
Writes that are potentially causally related must be seen by all processes in the same order

A

Casual consistency

RAAB CAS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What’s a lock? And how is it related to Entry consistency?

A

A synchronization mechanism used to control access to a shared resource.

Entry consistency implies that we need to lock and unlock data
(L(x) , U(x))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What’s a client centric consistency model for?

A

For example when a mobile user accesses different replicas of distant database

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is this definition?

A write operation by a process on a data item X is completed before any successive write operation on X by same process

A

Monotonic Writes ( ; inte |)

W(X1)
W(X1;X2) W(X2;X3)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What’s this definition?
If a process reads the vale of a data item X, any read on X by same process afterwards will return same or more recent value

A

Monotonic reads ( ; inte |)

W(X) R(X)
W(X1;X2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What’s this definition?
The effect of a write operation by a process on data item X will always be seen by a successive read operation on X by the same process

A

Read-your writes

W(X1)
W(X1;X2) R(X2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What’s this definition?
A write operation by a process on a data item X following a previous read operation on X by the same process is guaranteed to take place on the same or a more recent value of X that was read

A

Writes-follow-reads

W(X1) R(X)
W(X1;X2) W(X2;X3)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly