Maekawa's Mutual Exclusion algorithm - Quorum based approach

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

Amazing
Ma'am your video series helps me a lot while preparing for the semester exam.

dhanashrisaner
Автор

Mam, Please upload a lecture on Suzuki-Kasami's broadcast algorithm as soon as possible

sravyak
Автор

Good explanation with easy understanding really helpful 👍

prindamuthukrishnan
Автор

Thank you Prof Futuja, it helps me lots!

xuanyinglai
Автор

According to the book written by Mukesh Singhal, Size of the request set of all sites must be equal!

rupjyoti
Автор

Also upload video for chord, CAN, Tapeastry in distributed systems

Violet-wsdk
Автор

In your example P1 and P3 does not have common process.. So it is wrong

JyothishJohn-vxhe
Автор

It would have been awesome, if you could have given algorithm for implementation. Otherwise it was a good explanation.

samartajshaikh
Автор

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.

austinoquinn
Автор

Mam upload video for checkpointing & rollback recovery

Violet-wsdk
Автор

madem zujuki kasami alogorithm video cheyyandi

infinitykv
Автор

This explanation is not correct as it does not follow the MINIMALITY PROPERTY of quorum based algorithm....please recheck it.

gargijugran