Abstract
two efficient polynomial time resolution algorithms for the case of multiple resource units. The complexity of deadlock detection and resolution with our two resolution algorithms are O(NjN,) and O(NjNf + Np N,‘Nmin), where Np is the number of processes, N,. is the number of resources, and Nmin = min(N,, Nr). We prove that one algorithm is optimal in the special case when every process is blocked on no more than one resource unit. We also present comparison studies of the two algorithms with randomly generated deadlock scenarios. The results illustrate that, on average, the number of aborts in both techniques exceeds the optimum by less than 10%.
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.
