Amazing Explanation!!!!!!🙂 Ma'am your video series helps me a lot while preparing for the semester exam.
@simplifiedcomputersciencec2363
Жыл бұрын
Thank u so much🙏
@prindamuthukrishnan4134
Жыл бұрын
Good explanation with easy understanding really helpful 👍
@sravyak6617
2 жыл бұрын
Mam, Please upload a lecture on Suzuki-Kasami's broadcast algorithm as soon as possible
@jayendramanikumar9211
Жыл бұрын
Great explaining
@mr.nothing7058
Жыл бұрын
Thank You So much Madam.
@Violet-ws2dk
2 жыл бұрын
Also upload video for chord, CAN, Tapeastry in distributed systems
@zohaibhamdule
Жыл бұрын
Thanks a Lot!
@jayapriyan923
Жыл бұрын
Nice explanation🎉
@xuanyinglai5401
2 жыл бұрын
Thank you Prof Futuja, it helps me lots!
@ArunKumar-td4xf
Жыл бұрын
It's rutuja😅
@Violet-ws2dk
2 жыл бұрын
Good explanation
@rupjyoti2813
9 ай бұрын
According to the book written by Mukesh Singhal, Size of the request set of all sites must be equal!
@SaileeShingare
2 жыл бұрын
Thank you ma'am
@JyothishJohn-vx2he
Жыл бұрын
In your example P1 and P3 does not have common process.. So it is wrong
@ashokkumarnagam8704
2 жыл бұрын
Good explanation madam
@Violet-ws2dk
2 жыл бұрын
Very helpful
@simplifiedcomputersciencec2363
2 жыл бұрын
Thank u
@humbleguy9891
2 жыл бұрын
Thank you, please share the slides
@048_cse_surya42
Жыл бұрын
Clear
@austinoquinn815
7 ай бұрын
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.
@Pranauv
2 ай бұрын
that is one of the demerits of the algorithm... that deadlock is possible like u said...
@Violet-ws2dk
2 жыл бұрын
Mam upload video for checkpointing & rollback recovery
@an_son_mathew_
Жыл бұрын
❤
@infinitykv1678
2 жыл бұрын
madem zujuki kasami alogorithm video cheyyandi
@samartajshaikh2601
3 ай бұрын
It would have been awesome, if you could have given algorithm for implementation. Otherwise it was a good explanation.
@sunitabnsl
2 жыл бұрын
how the quorum is made.
@simplifiedcomputersciencec2363
2 жыл бұрын
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.
@s.duraiarasu8987
8 ай бұрын
G🎉
@gargijugran5284
4 ай бұрын
This explanation is not correct as it does not follow the MINIMALITY PROPERTY of quorum based algorithm....please recheck it.
Пікірлер: 30