Obermarck's Path pushing deadlock detection algorithm in distributed systems

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

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

if there is no deadlock in the system, then no matter how many times we repeat ourselves, we won't be able to find any deadlock. But we would be wasting time memory and networking resources in doing so. Is this a drawback of this algorithm?

aayushanand
Автор

MAM your teaching is really good can you create a playlist for the video's in sequence

anirudhbatchu
Автор

Mam yr way of explanation is very good. Pls make more videos on related topics to OS

Raj-rzvb
welcome to shbcf.ru