Abstract
The occurrence of deadlocks should be controlled effectively by their detection and resolution, but may sometimes lead to a serious system failure. After implying an efficient detection algorithm the deadlock is resolved by a deadlock resolution algorithm whose primary step is to either select the victim then to abort the victim transaction or cause it to rollback. This step resolves deadlock but is not efficient one. This paper proposes a new deadlock resolution algorithm which doesn‟t cause any aborts /roll backs in fact it is based on the mutual cooperation of transactions and a random number representing time duration for which the process holding the resource will be suspended.
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.
