Example: biology
OPERATING SYSTEMS DEADLOCKS - WPI

OPERATING SYSTEMS DEADLOCKS - WPI

Back to document page

Let's assume a very simple model: each process declares its maximum needs. In this case, algorithms exist that will ensure that no unsafe state is reached. EXAMPLE: There exists a total of 12 tape drives. The current state looks like this: In this example, < p1, p0, p2 > is a workable sequence. Suppose p2 requests and is

  Operating, Maximum, Deadlock

Download OPERATING SYSTEMS DEADLOCKS - WPI


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries