0% found this document useful (0 votes)
51 views2 pages

Logical Clcok Synchronization

Logical clocks are used in distributed systems to order events and determine causality between them. An event can be an instruction, procedure, sending or receiving a message. The "happened before" relation defines that: 1) events within the same process are ordered by their execution; 2) sending a message happens before receiving it in another process; 3) if A happened before B and B happened before C, then A happened before C. Distinct events are concurrent if neither happened before the other. Logical clocks help ascertain the ordering of events in a distributed system.

Uploaded by

sampathabo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
51 views2 pages

Logical Clcok Synchronization

Logical clocks are used in distributed systems to order events and determine causality between them. An event can be an instruction, procedure, sending or receiving a message. The "happened before" relation defines that: 1) events within the same process are ordered by their execution; 2) sending a message happens before receiving it in another process; 3) if A happened before B and B happened before C, then A happened before C. Distinct events are concurrent if neither happened before the other. Logical clocks help ascertain the ordering of events in a distributed system.

Uploaded by

sampathabo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

The concept of time in distributed systems is used to order events.

The
assumption is that the execution of a process is characterised by a
sequence of events. An event can be the execution at one instruction or of
one procedure or sending a message or receiving a message. Under some
condition it is possible to ascertain the order of the events logical clocks
try to catch this.

Logical clocks :

The happened before relation ( →→ ) is defined as follows :


A→BA→B if A & B are within the same process & A occured before B.
A→BA→B if A is an event at sending messages in one process end B is the
event of receiving M in another process.
A→BA→B and B→CB→C then A→CA→C
Event A causally affects event B if A→BA→B distinct events A & B are ( A
|| B) if we do not have A→BA→B or B→AB→A
Example:

You might also like