Skip to main content
SpringerLink
Log in

Distributed resource allocation algorithms

Extended abstract

  • Conference paper
  • First Online:
Book cover Distributed Algorithms (WDAG 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 647))

Included in the following conference series:

This work was carried out while the author was with the Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science.

Supported in part by a Walter and Elise Haas Career Development Award and by a grant from the Basic Research Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32:804–823, 1985.

    Google Scholar 

  2. B. Awerbuch, L. Cowen and M. Smith. Self-stabilizing symmetry breaking in poly-logarithmic time. Unpublished manuscript, 1992.

    Google Scholar 

  3. B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. In FOCS, pages 65–74. IEEE, 1990.

    Google Scholar 

  4. K. Chandy and J. Misra. The dining philosophers problem. In TOPLAS, pages 632–646. ACM, 1984.

    Google Scholar 

  5. E. W. Dijkstra. Hierarchical ordering of sequential processes. ACTA Informatica, pages 115–138, 1971.

    Google Scholar 

  6. L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21:558–565, 1978.

    Article  Google Scholar 

  7. N. Lynch. Upper bounds for static resource allocation in a distributed system. J. of Computation and System Sciences, 23:254–278, 1981.

    Google Scholar 

  8. M. O. Rabin and D. Lehmann. On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In 8th POPL, pages 133–138, 1981.

    Google Scholar 

  9. E. Styer and G. Peterson. Improved algorithms for distributed resource allocation. In 7th PODC, pages 105–116. ACM, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Open University of Israel, 61392, Tel-Aviv, Israel

    Judit Bar-Ilan

  2. Department of Applied Mathematics and Computer Science, The Weizmann Institute, 76100, Rehovot, Israel

    David Peleg

Authors
  1. Judit Bar-Ilan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Peleg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Adrian Segall Shmuel Zaks

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bar-Ilan, J., Peleg, D. (1992). Distributed resource allocation algorithms. In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-56188-9_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56188-0

  • Online ISBN: 978-3-540-47484-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation