L4tmp - Computer Science 425 Distributed Systems (Fall2009)...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 4-1 Computer Science 425 Distributed Systems (Fall2009) Lecture 4 Chandy-Lamport Snapshot Algorithm and Multicast Communication Reading: Section 11.5&12.4 Klara Nahrstedt
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 4-2 Acknowledgement The slides during this semester are based on ideas and material from the following sources: Slides prepared by Professors M. Harandi, J. Hou, I. Gupta, N. Vaidya, Y-Ch. Hu, S. Mitra. Slides from Professor S. Gosh’s course at University o Iowa.
Background image of page 2
Lecture 4-3 Administrative Form Groups for MP projects Up to 3 members per group Email names to TA today Homework 1 posted today, September 3 (Thursday) Deadline, September 17 (Thursday) Introductory material to get introduced to the Eclipse/Android Programming Environment is posted – Optional MP0 Posted on the class website
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 4-4 Plan for Today Chandy-Lamport Global Snapshot Algorithm New Topic: Multicast Communication
Background image of page 4
Lecture 4-5 Review A run is a total ordering of events in H that is consistent with each h i ’s ordering E.g., < e 1 0 , e 1 1 , e 1 2 , e 1 3 , e 2 0 , e 2 1 , e 2 2 , e 3 0 e 3 1 , e 3 2 > A linearization is a run consistent with happens- before ( ) relation in H E.g., < e 1 0 , e 1 1, e 3 0 , e 2 0 ,…>, < e 1 0 , e 3 0 , e 1 1 , e 2 0 , …> Concurrent events are ordered arbitrarily Linearizations pass through consistent global states P1 P2 P3 e 1 0 e 1 1 e 1 2 e 1 3 e 2 0 e 2 1 e 2 2 e 3 0 e 3 1 e 3 2 C3 C2 C1 C0
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 4-6 Chandy-Lamport “Snapshot” Algorithm “Snapshot” is a set of process and channel states for set of processes P i (i=1,…N) such that the recorded global state is consistent
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/14/2010 for the course CECS 574 taught by Professor Lamshui during the Spring '10 term at CSU Long Beach.

Page1 / 20

L4tmp - Computer Science 425 Distributed Systems (Fall2009)...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online