1 / 12

The P erformance of t he Chandy -Mishra Snapshot algorithm

The P erformance of t he Chandy -Mishra Snapshot algorithm. Jing Mao Instructor: Mikhail Nesterenko. Outline. Introduction Experimental Setup Code Implementation Results Analysis Conclusion Future Work References. Introduction. Chandy Mishra:

leala
Download Presentation

The P erformance of t he Chandy -Mishra Snapshot algorithm

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. The Performance of the Chandy-Mishra Snapshot algorithm Jing Mao Instructor: Mikhail Nesterenko

  2. Outline Introduction Experimental Setup Code Implementation Results Analysis Conclusion Future Work References

  3. Introduction • Chandy Mishra: • Any random process can take snapshot at random time • Snapshot consists of state information about the system and message queue

  4. Introduction • Measuring Performance of the snapshot Algorithms • Time complexity is measured by the number of messages in the longest chain of causally dependent events • Message complexity - number of messages it takes the algorithm to carry out specified task

  5. Experimental Setup Snapshot algorithms run on top of a basic algorithm. In this implementation Basic algorithm used is random flooding. Data points are inserted to count total number of messages forwarded and total Time taken. Number of processes: (5, 10,15,20, 25, 30,35)

  6. Code implementation The chandy-mishra snapshot algorithm is directly embedded in the class “SimulationEngine” Randomly pick a process to call snapshot function Two variables: time_complexity, message_complexity are used to track the total time and message complexity

  7. Results Analysis

  8. Results Analysis

  9. Conclusion As the number of processes grows, both the completion time and the number of messages increase Time complexity is much larger than messages complexity, the difference becomes more apparently with the increase of the number of the processes

  10. Future Work Algorithm implementations needs to be tested on large real distributed systems. Try different basic algorithms to verify the performance of chandy-mishra snapshot algorithm

  11. Thanks !

  12. Reference • LAMPORT,L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July 1978), 558-565. • CHANDY, K, LAMPORT, L. Distributed Snapshots: Determining Global States of Distributed Systems. ACM Transactions on Computer Systems, vol 3, no 1, Feb85. • Babaoglu, O, Marzullo , K, Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms, Distributed Systems, Sape J. Mullender, Addison-Wesley, 1993.

More Related