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.
Consider a particular system that does not have an interrupting clock. The only way a thread can lose the processor is to voluntarily surrender it. Additionally, the operating sy
The term IPC (Inter-Process Communication) defines several paths by which different process executing on some operating system interact between each other.
Consider the following C program where M, N, K are predefined constants. Assume int is 4 bytes. Suppose this program is run on a machine with 4KB page size and 32 TLB entries. Init
Q. When a process creates a fresh process using the fork() operation which of the following state is shared among the parent process and the child process? 1 Stack 2 Heap
LRU approximation page replacement In this we utilize the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for the imp
Define rotational latency and disk bandwidth. Rotational latency is the additional time waiting for the disk to rotate the wanted sector to the disk head. The disk bandwidth is
Q) a. Given that the first three necessary conditions for a deadlock are in place, comment on the feasibility of the following strategy. All processes are given unique priorities.
What are the various page replacement algorithms used for page replacement? FIFO page replacement Optimal page replacement LRU page replacement LRU approximat
What is graceful degradation? In multiprocessor systems, failure of single processor will not halt the system, but only slow it down by sharing the work of failure system by ot
Define ‘LRU’ page replacement policy LRU is Least Recently Used page replacement policy.
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