Abstract
Up to now, the supervision and control of deadlock-free resource allocation has received considerable attention, particularly regarding their deadlock problems. To date, most solutions have supposed that allocated resources never fail. However, this is quite the opposite in reality since some resources may fail unexpectedly. A robust system should be resilient to such failures. In this paper, resources are divided into reliable ones and unreliable ones. On the basis of the deadlock avoidance algorithm which is proposed for the problem of deadlocks, we propose a robust control algorithm in the paradigm of systems of sequential systems with shared resources, which can acquire and release resources in a multitype and multiquantity way. It is validated to be a polynomially complex robust control algorithm by the distributivity analysis. Finally, experimental results show that the proposed approaches are effective as well as efficient in response to resource failures.
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 callMore From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
Disclaimer: 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.
