انت هنا الان : شبكة جامعة بابل > موقع الكلية > نظام التعليم الالكتروني > مشاهدة المحاضرة

deadlock detection

_ Simulate the most favored execution of each unblocked process

·        An unblocked process may acquire all the needed resources

·        Run and then release all the acquired resources

·        Remain dormant thereafter

·        Released resources may wake up some previously blocked process

·        Continue the above steps as long as possible

·        If any blocked processes remain, they are deadlocked

_ Reduction of resource graphs

·        Process blocked if it cannot progress by either of the following operations

_ Request

_ Acquisition

_ Release

·        Reduction of resource graph

_ Reduced by a process pi

_ by removing all edges to and from pi

_ pi is neither blocked nor isolated node

pi becomes an isolated node