1 / 5

Ch3

Ch3. Deadlock definition Difference from starvation Conditions for Deadlock Exclusive access Hold & Wait Non Preemption Circular Wait Handled by prevention, detection, avoidance. Models of Deadlock. Single Unit Request And Model Or Model And/Or Model P out of Q model

kennethmbrown
Télécharger la présentation

Ch3

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. Ch3

  2. Deadlock definition • Difference from starvation • Conditions for Deadlock • Exclusive access • Hold & Wait • Non Preemption • Circular Wait • Handled by prevention, detection, avoidance

  3. Models of Deadlock • Single Unit Request • And Model • Or Model • And/Or Model • P out of Q model • Resource Models • Reusable • Consumable

  4. Graph Theoretic Models • Set of processes, set of resources (can be partitioned into disjoint set of consumable and reusable) • Reusable resources have a count, consumable resources have a set of producers

  5. General Resource Graph • Bipartite (why?) directed graph with processes and resources as nodes • Request edge directed from process to resource • Assignment edge from reusable resource to process • Producer edge from consumable resource to process

More Related