- For managing the physical clock, use the berkley's algorithm
- How can we manage the physical clock?
- Use the Berkley's algorithm and Cristina's algorithm
- For managing the logical clock, use the lamport's algorithm
- After the logical clock, vector clock is used
- In deadlock
- When two process try to access one resource at the same time.
- Incremental Ti, Ti+1 + Ti+2
- Decremental Ti, Ti-1 + Ti-2
- Resource Deadlock - when the processes are in deadlock due to the resources
- Time Stamp
- TS(P1) > Ts(P2)
- P for Process
- Check for the younger process and kill it
- Request > Response > Commit
- Distributed Mutual Exclusion
- Deadlock Prevention Methods:
- Wait & Die, FCFS (On the basis of first come first serve)
- Bound & Wait (Block the younger one, and execute the existing one)
- Wound-wait
- CS = Critical Section
- Circular Deadlock
- It can detect using the wait for a graph algorithm.
- Note the timestamp based messages, ordering at Coordinator.
- This can be prevented by killing any of the process
- Its also known as the false deadlock
- Physically they are separate
- Logically they are one
- Wait for graph is the directed graph, connected through the vertices.
Recent Pastes