O'Reilly logo

Operating Systems: Concurrent and Distributed Software Design by Tim Harris, Jean Bacon

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

18.10. Distributed deadlocks

The resources that are allocated dynamically may reside at different nodes of a distributed system. Requests for use of a resource may come from a source outside its home node. We have seen the possible mechanisms for making such requests in Chapter 16; for example a message or RPC requesting a resource may be pended by the resource manager until the resource becomes free, thus blocking the requesting thread.

In the discussion so far in this chapter we have assumed that global knowledge of the allocation of resources and requests for their use is available to algorithms for deadlock detection or avoidance. This can be made the case in a distributed system if we implement a centralized resource allocator. All requests ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required