Safety algorithm: This is to make sure if the system is in safe state or not. It may need an order of m x n2 operation to determine if the state of the system is safe or not.

Resource Request algorithm: This determines if the resources are able to be safely granted. If the request is less than the available resources means the system can grant the resources but if this condition is false, after that the system should wait for the resources.

 

Posted Date: 6/22/2013 7:48:14 AM | Location : United States

Ask an Expert

Related Discussions:- Safety algorithm and resource request algorithm, Assignment Help, Ask Question on Safety algorithm and resource request algorithm, Get Answer, Expert's Help, Safety algorithm and resource request algorithm Discussions

Write discussion on Safety algorithm and resource request algorithm
Your posts are moderated

Write your message here..

Related Questions

Activities of operating system-secondary-storage management, Q. What are th... Q. What are the three main activities of an operating system in regard to secondary-storage management? Answer: 1) Free-space management 2) Storage allocation 3) Disk

What is a general graph, What is a general graph? A tree structure wher... What is a general graph? A tree structure where links can go from one branch to a node earlier in the similar branch or other branch, allowing cycles.

Explain types of file allocation- linked list allocation, Linked list alloc... Linked list allocation: At this time the blocks are stored using linked lists. The block size require not be the same. Thus internal fragmentation is avoided. Consider

Operation research, scattered resposibi;ity and authority -necessity of ope... scattered resposibi;ity and authority -necessity of operation research

Explain processing predefined application protocols, Explain Processing Pre... Explain Processing Predefined Application Protocols Implementing and swift processing of predefined application protocols is sure to improve performance of server - side applic

Packets and time division multiplexing (tdm), Broken data into small packet... Broken data into small packets allow time division multiplexing. In TDM every packet leaves the sender and is switched on the shared interaction channel through a multiplexer. At t

Explain variable partitioning in memory management, VARIABLE PARTITIONING ... VARIABLE PARTITIONING We can differ the partitions and change the location according to the size of the process.   50k 40k

Process Management, In a table format, discuss the differences between th... In a table format, discuss the differences between the fixed partition and the variable partition memory organization in terms of the basic idea, memory structure, advantages

How many cubic feet of storage space would require, Q. Presume that we agr... Q. Presume that we agree that 1 kilobyte is 1,024 bytes 1 megabyte is 1,0242 bytes and 1 gigabyte is 1,0243 bytes. This progression carries on through terabytes, petabytes, and ex

Microsoft, Discuss the high barriers to entry in the market for PL operatin... Discuss the high barriers to entry in the market for PL operating systems