Distributed resource sharing in computer networks

  • Inder S. Gopal
  • Parviz Kermani
Session 5 Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 241)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. GRO 85.
    G.A.Grover, J.M.Jaffe "Standoff and Standoff Resolution in Deadlock Free Networks", IBM Research Report, RC 11009, 1985.Google Scholar
  2. 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
  3. SEG 83.
    A. Segall, "Distributed Network Protocols," IEEE Trans. on Information Theory, Vol.IT-29, No.1, pp.23–35, Jan. 1983.Google Scholar
  4. AWE 85.
    B. Awerbuch, "A New Distributed Depth-First-Search Algorithm," Information Processing Letters, Vol.20, pp.147–150, 1985.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Inder S. Gopal
    • 1
  • Parviz Kermani
    • 1
  1. 1.IBM T. J. Watson Research CenterYorktown Heights

Personalised recommendations