1 / 13

Implementation Of Lamport’s Scalar Clocks

Implementation Of Lamport’s Scalar Clocks. Surekha Busa. Contents. Introduction Implementation Rule Experimental Setup Result Analysis Observation Future Work. INTRODUCTION. To show casualty in distributed system Each process P i has a logical clock C i assigned with an integer

bell-webb
Download Presentation

Implementation Of Lamport’s Scalar Clocks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Implementation Of Lamport’s Scalar Clocks SurekhaBusa

  2. Contents • Introduction • Implementation Rule • Experimental Setup • Result Analysis • Observation • Future Work

  3. INTRODUCTION • To show casualty in distributed system • Each process Pi has a logical clock Ci assigned with an integer • the assigned value is the timestamp of this event, denoted C(a) • The timestamps are monotonically increasing • consistency condition • consistency: if ab, then C(a) C(b) • if event a happens before event b, then the clock value (timestamp) of a should be less than the clock value of b • strong consistency: if C(a)C(b) then ab • scalar clocks are not strongly consistent

  4. IMPLEMENTATION RULE • Outgoing messages tagged with Sender’s clock value • Upon receive of message: myclock = MAX(message, myclock)

  5. e11 e12 e13 e14 e15 P1 (4) (1) (2) (5) e21 e22 e23 P2 (1) (2) (4) EXPERIMENTAL SETUP • Base Algorithm : Random Flood. • Whenever the clock of the receiver take the value of the clock of the message we say the clock is updated. • Total No. of updates per process(number of updates/no of processes)is calculated by increasing the number of processes from 10-100. (3) Clock is not Updated Clock is Updated

  6. RESULT ANALYSIS: No. Of Updates and Messages Varying No. Of Processes

  7. RESULT ANALYSIS: No. Of Updates and Messages Per Process Varying No. Of Processes

  8. RESULT ANALYSIS: No. Of Messages Versus No. Of Clock Updates

  9. OBSERVATION • No. Updates and messages per process increases with increase in No. of Processes. • No. of clock updates increase with increase in No. of Messages.

  10. FUTURE WORK • To observe its performance over various topologies. • To test my program with much larger no. of processes. • Test my program on a real distributed network.

  11. REFERENCE [1] Leslie Lamport (1978). ”Time, clocks, and the ordering of events in a distributed system”. Communications of the ACM 2 (7): 558-565. [2] Mukesh Singhal,Niranjan G. Shivaratri.“Advanced Topics in Operating Systems”. McGRAW-Hill international edition:Chapter 5. Code Defence

  12. THANK YOU..!!

More Related