Abstract
In this paper we consider the problem of the distributed deadlock resolu tion. Starting from a high level specification of the problem and the resolution algorithm for a system with single request model, we provide successive levels of decreasing ab straction of the initial specification in order to achieve a solution in a complete distributed system. The successive refinements and the final distributed deadlock resolution algo rithm are formaly described and proved by using the Input-Output Automata Model. The proposed solution is a modification of the algorithms in Mitchell and Merritt (1984) and Gonzalez de Mendivil et al. (1993) and preserves a similar message traffic to resolve a deadlock.
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.
