Distributed resource sharing in computer networks
In this paper we address a resource sharing problem that arises in distributed systems. The problem is to provide a mechanism whereby a node can obtain, in a distributed network, control of a set of resources that are necessary in performing a certain task. The mechanism has to provide a "reasonable guarantee" that if sufficient resources are available, the node will be able to obtain them. We define what such a "reasonable guarantee" means in a dynamic environment with resources constantly being added or removed from the pool of available resources. We then propose a distributed algorithm and show that it provides such a guarantee. Finally, we suggest extensions to the basic mechanism to improve performance.
- G.A.Grover, J.M.Jaffe "Standoff and Standoff Resolution in Deadlock Free Networks", IBM Research Report, RC 11009, 1985.
- J.P.Gray, "SNA operating system services to support distributed processing", Proceedings of the 1982 International Large Scale Systems Symposium, pp.161–165, 1982.
- Segall, A. (1983) Distributed Network Protocols. IEEE Trans. on Information Theory IT-29: pp. 23-35
- Awerbuch, B. (1985) A New Distributed Depth-First-Search Algorithm. Information Processing Letters 20: pp. 147-150
- Distributed resource sharing in computer networks
- Book Title
- Foundations of Software Technology and Theoretical Computer Science
- Book Subtitle
- Sixth Conference, New Delhi, India December 18–20, 1986 Proceedings
- pp 319-329
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.