Abstract
Resource allocation graphs are directed bipartite graphs satisfying certain constraints. The two partitions of the vertex set correspond to the processes and resources of a multi-programming computer system, and the edges indicate resource allocations and requests. When all the resources are distinguishable, existence of a cycle in such a graph is equivalent to deadlock in the system. The main results here are exact and asymptotic formulas for the number of resource allocation graphs and acyclic resource allocation graphs with m processes, n allocated resources, and q edges. If a uniform probability distribution is taken on such graphs, then the proportion of blocked processes, $( q - n )/m$, determines the asymptotic behavior of the probability of deadlock: If $( q - n )/m \to 0$, then the probability of deadlock is asymptotic to 0, and if $( q - n )/m \to \alpha > 0$, then the probability is asymptotic to a positive value. Similar formulas are also given in terms of m and n only.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
