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.
KeywordsSequence Number Collection Process Request Message Correctness Property Feedback Message
Unable to display preview. Download preview PDF.
- GRO 85.G.A.Grover, J.M.Jaffe "Standoff and Standoff Resolution in Deadlock Free Networks", IBM Research Report, RC 11009, 1985.Google Scholar
- GRA 82.J.P.Gray, "SNA operating system services to support distributed processing", Proceedings of the 1982 International Large Scale Systems Symposium, pp.161–165, 1982.Google Scholar
- SEG 83.A. Segall, "Distributed Network Protocols," IEEE Trans. on Information Theory, Vol.IT-29, No.1, pp.23–35, Jan. 1983.Google Scholar
- AWE 85.B. Awerbuch, "A New Distributed Depth-First-Search Algorithm," Information Processing Letters, Vol.20, pp.147–150, 1985.Google Scholar