1 / 3

Simple Deadlock

Simple Deadlock. Thread A: Thread B: lock_acquire(l1); lock_acquire(l2); lock_acquire(l2); lock_acquire(l1); ... ... lock_release(l2); lock_release(l1); lock_release(l1); lock_release(l2 );. Circular Requests. P2. P4. R4. "Owned by". R2. R3. R4. R2. R3. Resource. P3. P1. P1.

gerd
Télécharger la présentation

Simple Deadlock

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Simple Deadlock Thread A: Thread B: lock_acquire(l1); lock_acquire(l2); lock_acquire(l2); lock_acquire(l1); ... ... lock_release(l2); lock_release(l1); lock_release(l1); lock_release(l2); CS 140 Lecture Notes: Deadlock

  2. Circular Requests P2 P4 R4 "Owned by" R2 R3 R4 R2 R3 Resource P3 P1 P1 P2 "Waiting for" R1 R1 Process No Circularity Circularity CS 140 Lecture Notes: Deadlock

  3. CS 140 Lecture Notes: Deadlock

More Related