Experiment Text: To simulate the functioning of Lamport$$s Logical clock in $$c$$

Prerequisites: Global Clock Concept, C programming$($python$)$

Outcome: Program will exhibit the simulation of Lamport$$ logical clock behavior based on two rules.

What Student will learn? As discussed in class student will learn how this experiment can decide happened before relation between any two event on same process and across the processes.

Description: The "time" concept in distributed systems $--$ used to order events in a distributed system.

Assumption:

The execution of a process is characterized by a sequence of events. An event can be the execution of one instruction or of one procedure.

Sending a message is one event, receiving a message is one event.

The events in a distributed system are not total chaos. Under some conditions, it is possible to ascertain the order of the events. Lamport's logical clocks try to catch this.

Lamport's $`$happened before'$\text{'}$ relation

The $``$happened before'$\text{'}$ relation $()$ is defined as follows:

A $$ B if A and B are within the same process $($same sequential thread of control$)$ and A occurred before B$.$

A $$ B if A is the event of sending a message M in one process and B is the event of receiving M by another process

if A $$ B and B $$ C then A $$ C Event A causally affects event B iff A $$ B$.$

Distinct events A and B are concurrent $($A $||$ B$)$ if we do not have A $$ B or B $$ A$.$