Is there any method to deal with distributed deadlock when multiple instances are available for each resource type?
I think method of wait-for graph and chase algorithm can be used only when single instance of each resource type is available.

It depends on how you want to deal with and how each resource becomes available. I don't think there is an absolute algorithm to solve the problem due to so many factors are involved.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.