How can the deadlock be prevented-safe state, Operating System

Assignment Help:

How can the deadlock be prevented-Safe State

Safe state: A state is safe if the system is able to allocate resources to each process in some order and still avoid deadlock. Further properly a system is in safe state only if there exists a safe sequence. Safe sequence is the ways that the sequence of process in the waiting queues getting the requested resources. If it does not get the requested resources then it will have to wait. A safe state isn't deadlocked state. On the contrary a deadlock state is an unsafe state. Not all unsafe states are considered as deadlock though an unsafe state may lead to a deadlock. As long as the state is safe the operating system can avoid unsafe states. In an unsafe state, the Operating System can't prevent processes from requesting resources such that a deadlock occurs.

 


Related Discussions:- How can the deadlock be prevented-safe state

Business, why some companies do not pay sufficient attention to staff induc...

why some companies do not pay sufficient attention to staff induction

Write a short note on the linux file systems, Question: (a) Red Hat Li...

Question: (a) Red Hat Linux is distributed under the Open Source agreement. Explain what you understand by Open Source distribution system. (b) Write a short note on the L

Unix operating system, A working Ubuntu Linux operating system.  You can us...

A working Ubuntu Linux operating system.  You can use a Live-CD to complete this assignment. Create an empty text file named assignment6.txt in your home directory. Edit this

Define what an assembler is, Define what an assembler is An assembler i...

Define what an assembler is An assembler is machine dependant.

Ipc, Explain in detail about ipc in linux

Explain in detail about ipc in linux

Difference between preemptive and nonpreemptive scheduling, Define the diff...

Define the difference between preemptive and nonpreemptive scheduling. State why strict nonpreemptive scheduling is unlikely to be used in a computer center. Preemptive schedul

Define dynamic linking, Define dynamic linking. Dynamic linking is same...

Define dynamic linking. Dynamic linking is same to dynamic loading, rather that loading being postponed unless execution time, linking is postponed. This feature is usually use

Memory management, with aid of diagram describe 2 types of fixed partition ...

with aid of diagram describe 2 types of fixed partition allocation used in operating system

Explain the procedure for handling the page fault, The procedure for handli...

The procedure for handling the page fault is as follows 1. We check the internal table to verify whether the reference was valid or invalid. 2. If the reference was invalid,

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