Obermarck's Path pushing deadlock detection algorithm in distributed systems

แชร์
ฝัง
  • เผยแพร่เมื่อ 14 ม.ค. 2025

ความคิดเห็น • 4

  • @aayushanand8285
    @aayushanand8285 ปีที่แล้ว +8

    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?

  • @Raj-rz9vb
    @Raj-rz9vb 2 ปีที่แล้ว +2

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

  • @anirudhbatchu2907
    @anirudhbatchu2907 2 ปีที่แล้ว +3

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