Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
How can the deadlock be prevented? To evade deadlocks first we will have to obtain the information about how resources are to be requested. And as well we should make sure that
Define the properties of Interactive operating system Interactive:- This system is composed of many short transactions where the results of the next transaction may be unpred
What are the different types of semaphore? Principally the semaphore is able to be classified into two on the basis of their values a) Counting semaphore: In counting s
What is a Process Control Block? Every process in the operating system is represented by a process control block as well called a task control block. It contains several pieces
What is the different between basic synchronization and high level synchronization
Assume there are only 4 page frames in the physical memory, for the following reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2, 8. a) What i
categorize the CPU scheduling algorithms and among them explain the non-preemptive algorithms..
4. Describe priority scheduling algorithm. Consider the following set of processes. Show the order in which the algorithm will schedule these processes. Assume preemptive and non-p
USER-LEVEL THREADS (ULT) In this level the kernel isn't aware of the existence of threads -- All thread management is complete by the application by using a thread library. Th
What are the different directory structures? Explain each type. There are five dissimilar directory structures: 1. Single level directory 2. Two level directory
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd