What are the necessary conditions for deadlocks?, Operating System

Assignment Help:

What are the necessary conditions for deadlocks?

1.Mutual exclusion:  Only one process at a time is able to use the resource.

2.Hold and wait:  A process should be holding at least one resource and waiting   to acquire additional resources that are currently being held by other processes.

3.No preemption:  Resource cannot be preempted that is, a resource is able to be released only voluntarily by the process holding it, subsequent to that process has completed its task.

4.Circular wait:A set {p0,p1,.........,pn} of waiting processes should exit such that p0 is waiting for a resource that is held by p1 and p1 is waiting for a resource that is held by p2,.........,pn-1 is waiting for a resource that is held by pn, and pn is waiting for a resource that is held by p0.

 


Related Discussions:- What are the necessary conditions for deadlocks?

Describe the differences among short-term and medium-term, Describe the dif...

Describe the differences among short-term, medium-term, and long-term scheduling.   Short-term (CPU scheduler)-selects from jobs in memory those jobs that are ready to execu

Main advantages of the microkernel approach to system design, What are the ...

What are the main advantages of the microkernel approach to system design? Benefits typically contain the following  (a) Adding a new service does not require modifying the

Write a note on semaphores, Write a note on semaphores A semaphore is a...

Write a note on semaphores A semaphore is a tool meant for synchronizing multiple processes trying to access a shared variable. That is a semaphore is used to deal with the cri

Define logical address and physical address, Define logical address and phy...

Define logical address and physical address. An address formed by the CPU is referred as logical address. An address seen by the memory unit that is the single loaded into the

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Explain kernel activity for ults, KERNEL ACTIVITY FOR ULTS: The kernel...

KERNEL ACTIVITY FOR ULTS: The kernel isn't aware of thread activity but it is still managing process activity. When a thread compose a system call the whole process will be bl

Nachos file system, File System Interface and Implementation The Nachos ...

File System Interface and Implementation The Nachos file system, as distributed, uses a single-level index allocation method for data allocation of files. In the current design,

What are the operations that can be performed on a directory, What are the ...

What are the operations that can be performed on a directory? The operations that can be performed on a directory are Search for a file Create a file Delete a

CPU Scheduing FCFS, Assume that P A , P B and P C are three distinguished p...

Assume that P A , P B and P C are three distinguished program s . When P A is executed, it needs 10 ticks to complete its execution and it forks new processes executing P B at tick

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd