Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32:804–823, 1985.
B. Awerbuch, L. Cowen and M. Smith. Self-stabilizing symmetry breaking in poly-logarithmic time. Unpublished manuscript, 1992.
B. Awerbuch and M. Saks. A dining philosophers algorithm with polynomial response time. In FOCS, pages 65–74. IEEE, 1990.
K. Chandy and J. Misra. The dining philosophers problem. In TOPLAS, pages 632–646. ACM, 1984.
E. W. Dijkstra. Hierarchical ordering of sequential processes. ACTA Informatica, pages 115–138, 1971.
L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21:558–565, 1978.
N. Lynch. Upper bounds for static resource allocation in a distributed system. J. of Computation and System Sciences, 23:254–278, 1981.
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.
E. Styer and G. Peterson. Improved algorithms for distributed resource allocation. In 7th PODC, pages 105–116. ACM, 1988.
Author information
Authors and Affiliations
Editor information
Rights 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