Abstract
The design issues for asynchronous group mutual exclusion have been modeled as the Congenial Talking Philosophers, and solutions for shared-memory models have been proposed [4]. This paper presents an efficient and highly concurrent distributed algorithm for computer networks where processes communicate by message passing.
Abstract
This research was supported in part by the National Science Council, Taipei, Taiwan, under Grants NSC 86-2213-E-002-053 and NSC 87-2218-E-002-050, and by the 1998 Research Award of College of Management, National Taiwan University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Ben-Ari. Principles of Concurrent and Distributed Programming. Prentice-Hall, 1990.
F. N. David and D. E. Barton. Combinatorial chance. Charles Griffin & Co., 1962.
C. A. R. Hoare. Communicating sequential processes. CACM, 21(8):666–677, August 1978.
Y.-J. Joung. Asynchronous group mutual exclusion (extended abstract). In Proc. 17th ACM PODC, pp. 51–60, 1998.
L. Lamport. Time, clocks and the ordering of events in a distributed system. CACM, 21(7):558–565, July 1978.
A. M. Law and W. D. Kelton. Simulation modeling & analysis. McGraw-Hill, 1991.
N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
M. Raynal. Algorithms for Mutual Exclusion. MIT Press, 1986.
M. Raynal. About logical clocks for distributed systems. ACM Operating Systems Review, 26(1):41–48, January 1992.
G. Ricart and A. K. Agrawala. An optimal algorithm for mutual exclusion in computer networks. CACM, 24(1):9–17, January 1981.
R. Schwarz and F. Mattern. Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing, 7(3):149–174, March 1994.
A. Silberschatz and P. Galvin. Operating System Concepts. Addison-Wesley, fourth edition, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joung, YJ. (1999). The Congenial Talking Philosophers Problem in Computer Networks. In: Jayanti, P. (eds) Distributed Computing. DISC 1999. Lecture Notes in Computer Science, vol 1693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48169-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-48169-9_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66531-1
Online ISBN: 978-3-540-48169-0
eBook Packages: Springer Book Archive