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
Problem: (a) Modern operating systems are interrupt driven. If there are no processes to execute, no I/O devices to service, and no users to whom to respond, an operating syste

Performance of demand paging Demand paging can have an important effect on the performance of a computer system. As long as there are no page faults, the effective access time

COMPARISON OF DISK SCHEDULING ALGORITHMS Name      Description                  Remarks      (Selection according to requestor)   RSS        Random scheduling     fo

Define the DosExit Function used in the OS/2 DosExit(action, resultCode)  DosExit function is to be called when a thread or process is finished executing. If EXIT_THREAD is

what is the latest OS of ANDROID in US


How free-space is managed using bit vector implementation? The free-space list is implemented as a bit map or bit vector. Each block is shown by 1 bit. If the block is free, th

Explain the Architecting For Threads When available, threads are an integral part of any multitasking server application program. It is important that the operating system prov

The principle is that of ordinary addition; however remember the highest number is 1.   Calculate the following:                             11001 +                           11

Q. Timers could be utilized to compute the current time. Provide a little description of how this could be accomplished. Answer: A program could utilize the following ap