Resource Allocation Graph
A Resource Allocation Graph (RAG for short) is a directed graph that relates resources and processes . It is used to analyze deadlocks . If there is no cycle in the RAG, no deadlock can occur.
Each node is either a process node P i or a resource node R j . An edge from a resource node R j to a process node P i means that the process P i holds the resource R j , and an edge from a process node P k to R j means that the process P k is waiting for the resource R. j becomes free.
Individual evidence
- ^ Abraham Silberschatz, Peter B. Galvin, Greg Gagne: Operating system concepts . 7th edition. John Wiley & Sons, Hoboken 2005, ISBN 0-471-69466-5 , pp. 258 (English).