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
Direct memory access Many computers avoid burdening the main CPU with programmed I/O by offloading sine if this work to a special-purpose processor known as a direct memory add

Determine the task of the Pass II In a two-pass assembler Synthesize the target program is the task of the Pass II

Translation Look aside Buffer In a cached system, the base addresses of the last few indexed pages is maintained in registers named the TLB that adds in faster lookup. TLB has

Objectives 1.    Login to UNIX system and logout 2.    Learn features of the vi editor and to use online help (main pages).  Gain experience using them to create a document

Question: a) Each process is represented in the operating system by a process control block (PCB). The PCB contains many pieces of information associated with a specific proce

What is a pure demand paging? When starting implementation of a process with no pages in memory, the operating system sets the instruction pointer to the first instruction of t

Q. Consider a system in which a program is able to be separated into two parts: code and data. The CPU recognizes whether it wants an instruction (instruction fetch) or data (data

What are the objectives and functions of operating system? Functions of operating systems 1.      It allocates the resources and acts as a supervisor. 2.      It hides th

Briefly explain about file system implementation? Several on-disk and in-memory structures are used to execute a file system. On disk, the file system may have information abou

When a computer is started on, the program that executed first is named the ''operating system.'' It controls pretty much all applications in the computer. This adds who logs in, h