Deadlock-avoidance safety algorithm, Operating System

Q. Presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm. Can you do thus by simply using the safety algorithm code and redefining Maxi = Waiting + Allocation where Waiting is a vector specifying the resources process i is waiting for, and Allocation is as defined in Section 7.5? Describe your answer.

Answer:

Yes. The Max vector symbolizes the maximum request a process may make. When computing the safety algorithm we use the Need matrix which represents Max- Allocation. One more way to think of this is Max = Need + Allocation. As-per to the question the Waiting matrix fulfils a role similar to the Need matrix therefore Max = Waiting + Allocation.

Posted Date: 7/27/2013 5:05:01 AM | Location : United States







Related Discussions:- Deadlock-avoidance safety algorithm, Assignment Help, Ask Question on Deadlock-avoidance safety algorithm, Get Answer, Expert's Help, Deadlock-avoidance safety algorithm Discussions

Write discussion on Deadlock-avoidance safety algorithm
Your posts are moderated
Related Questions
What is linked allocation, as detailed in text? Directory has pointers to first and last blocks of file. Every block of file (except last) has pointer to the next block.

Now let's implement bounded producer-consumer with semaphores, a Coke machine which is initially empty: semaphore sem_mutex = 1 // binary semaphore for mutual exclusion, 1==unlo

People arrive at a barber shop at the rate of one every 4.5 minutes. If the shop is full (it can hold five people altogether), 30% of the potential customers leave and come back i

Question : (a) The dynamic allocation problem is how to satisfy a request of size n from a list of free holes into memory. The best-fit, first-fit and worst-fit strategies are

What are the drawbacks of spiral model? I. It is based on customer communication. If the communication is not proper then the software product that gets developed will not be t

Q. In some systems a subdirectory is able to be read and written by an authorized user just as ordinary files can be. a. Explain the protection problems that could arise. b.

Briefly explain process management in Windows 2000. The Windows 2000 process manager provides for deleting, creating and using threads and processes. It has no knowledge about

Q. Several CPU-scheduling algorithms are parameterized for instance the RR algorithm requires a parameter to indicate the time slice. Multilevel response queues require parameters

Q. Advantages and disadvantages of multiprogramming? Advantages 1.    High CPU utilization. 2. It appears that many programs are allotted CPU almost concurrently. D

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4 Provide two programm