Scribd
Upload
6 views20 pages

Unit 2 Part 2

Uploaded by

menakababu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
6 views20 pages

Unit 2 Part 2

Uploaded by

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

CS 3551

DISTRIBUTED
COMPUTING
Global State - Overall state of the distributed
system
● Why finding global state is difficult?
○ No shared memory between systems.
○ No common global clock.
○ Difficult to synchronize different local clocks.
● How global state is computed?(Process states+ Channel
States)
○ Process state - Local Memory + Historical Activity
○ Channel state - Msg sent/received
○ All these should be computed at same time instant
● What is the need of global states?
○ Deadlock Detection
○ Termination
○ Failure Recovery
○ Debugging
What happens if state is computed at
different time
instant
?
M12
P1 P2
C12
Cuts- A cut is a line joining an arbitrary point on each process line that slices the space–
time diagram into a PAST and a FUTURE
Key
Points
Snapshot Algorithm - Real Life
Example
Overall Objective - Check if ready or not for
event
Symposium Organize Ashi - Stage
f Arrangement
Hari
Aravind- Seating
- Food
Arrangement
Arrangement
Ashif Aravind
How person records his state? How Aravind receives signal from
Ashif?
1) Photo of arrangement - Case 1 : Aravind has not recorded his
Snapshot own
2) Signal to all others through state
channel

Case 2 : Aravind has recorded his own


state
Chandy Lamport
Algorithm
Key
Points
Properties of Recorded Global
State
Explanatio
n of
Example

You might also like