How is deadlock avoided? If nodes 1 and 2 have more than one shared member in their quorums. Say they send their requests at the same time but one shared member approves of one while the other approves of 2. this means neither 1 nor 2 would enter the critical section.
size of quorum 'K' is generally calculated as sqrt(no. of nodes). In some literature, K is chosen first and later N(no of nodes) is calculated with formula N=K(K-1)+1. There are algorithms to choose these sets but these arent discussed much. But for example if K = 2 then N = 3 by substituting the values in the formulae.
Amazing Explanation!!!!!!🙂
Ma'am your video series helps me a lot while preparing for the semester exam.
Thank u so much🙏
Good explanation with easy understanding really helpful 👍
Thank you Prof Futuja, it helps me lots!
It's rutuja😅
Great explaining
Mam, Please upload a lecture on Suzuki-Kasami's broadcast algorithm as soon as possible
Thank You So much Madam.
According to the book written by Mukesh Singhal, Size of the request set of all sites must be equal!
In your example P1 and P3 does not have common process.. So it is wrong
Nice explanation🎉
Also upload video for chord, CAN, Tapeastry in distributed systems
Very helpful
Thank u
Thanks a Lot!
Good explanation
Good explanation madam
Thank you ma'am
It would have been awesome, if you could have given algorithm for implementation. Otherwise it was a good explanation.
How is deadlock avoided? If nodes 1 and 2 have more than one shared member in their quorums. Say they send their requests at the same time but one shared member approves of one while the other approves of 2. this means neither 1 nor 2 would enter the critical section.
that is one of the demerits of the algorithm... that deadlock is possible like u said...
Thank you, please share the slides
Mam upload video for checkpointing & rollback recovery
madem zujuki kasami alogorithm video cheyyandi
Clear
How can I trust you're an accual professor?
If you have faith then believe it else👎
❤
how the quorum is made.
size of quorum 'K' is generally calculated as sqrt(no. of nodes). In some literature, K is chosen first and later N(no of nodes) is calculated with formula N=K(K-1)+1. There are algorithms to choose these sets but these arent discussed much. But for example if K = 2 then N = 3 by substituting the values in the formulae.
This explanation is not correct as it does not follow the MINIMALITY PROPERTY of quorum based algorithm....please recheck it.
G🎉