Skip to Main Content
Operating Systems: Concurrent and Distributed Software Design
book

Operating Systems: Concurrent and Distributed Software Design

by Jean Bacon, Tim Harris
March 2003
Intermediate to advanced content levelIntermediate to advanced
912 pages
27h 17m
English
Pearson Business
Content preview from Operating Systems: Concurrent and Distributed Software Design

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 ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Principles of Concurrent and Distributed Programming, Second Edition

Principles of Concurrent and Distributed Programming, Second Edition

M. Ben-Ari
Operating Systems in Depth

Operating Systems in Depth

Thomas W. Doeppner

Publisher Resources

ISBN: 0321117891Purchase book