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
Why are segmentation and paging sometimes combined into one scheme? Segmentation and paging are often combined in order to improve upon each other. Segmented paging is helpful

Which is most common phase structured grammar? Most common phase structured grammar is Context – Sensitive


Define the Scheduling in Multitasking Earlier we learned the concepts and advantages of multitasking. In a system in which one or more tasks( threads or processes) attempt to s

Consider a demand-paging system with the following time-measured utilizations: CPU utilization: 10%, Paging disk: 98%, Other I/O devices: 5%. What does this imply? How to improv

The permission function is used to calculate what, if any access each class or level of user has to each file on a Unix machine. The permission task is one of the data components s

Explain thread in details

. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

protection in operating system

Long term scheduling Scheduling explicitly performed when a new process is created and it determines which programs are admitted to the system for processing. Therefore it cont