Question: Consider the following hierarchical deadlock-detection algorithm, in which the global wait-for graph is distributed over a number of different controllers, which are organized in a
• Controller SC
• Every controller in the path from SC to SA
• Every controller in the path from SC to SB
In addition, if Ti and Tj appear in the wait-for graph of controller SD and there exists a path from Ti to Tj in the wait-for graph of one of the children of SD, then an edge Ti → Tj must be in the wait-for graph of SD.
Show that, if a cycle exists in any of the wait-for graphs, then the system is deadlocked.
Step by Step Solution
3.38 Rating (160 Votes )
There are 3 Steps involved in it
Hence for the final analysis we can say that ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
926-B-F-R-A (388).docx
120 KBs Word File
