Several new algorithms that utilize wmt-for relations mduced by processes are developed for deadlock avoidance in operating systems. One of the algorithms allows more concurrency than Havender's scheme and Habermann's algorithm; nonetheless, it can still be computed in polynomial time. Further, the deadlock,prediction problem for a set of processes using locks is reduced to a new NP-complete problem, and the deadlock-avoidanceproblemfor processes with branches is shown to be PSPACE-complete, Finally, the relative power of various algorithms is compared.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.