Abstract
A major problem in multiprogramming systems in which processes may wait for resources is the prevention or detection of deadlocks. Deadlock is the situation in which one or more processes are blocked forever waiting for resources which can never become available. This problem has received considerable attention recently (see for example [1, 3, 4, 5, 6, 8, 9].) This note introduces a conceptually simple graph model; this model unifies much of the previous work on deadlock, leads to fast deadlock detection and prevention algorithms, and is suitable for teaching purposes.
Sign-in/Register to access full text options 
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.
