If no cycle exists in the resource allocation graph                          

Related MCQs

• The resource allocation graph is not applicable to a resource allocation system
• If the wait for graph contains a cycle
• If the wait for graph contains a cycle :
• Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
• In contiguous memory allocation
• Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
• A system is in a safe state only if there exists a                          
• Swap space exists in                          
• The wait-for graph is a deadlock detection algorithm that is applicable when
• An edge from process Pi to Pj in a wait for graph indicates that