Abstract
In this paper, I have presented a paradigm based on Smart-Messages. A Smart-Message is a message that carries intelligence in the form of a program element. The paper discusses the anatomy of a Smart-Message along-with its application in solving two of the important problems in distributed systems: Leader election problem and Mutual exclusion problem.
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.
References
Chang, E., Roberts, R.: An improved Algorithm for Decentralized Extrema Finding in Circular Configuration of Processes. Communications of the ACM 22(5), 281–283 (1979)
Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Communications of the ACMÂ 24(1) (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dey, S. (2007). Solving Classic Problems in Distributed Systems: The Smart-Message Paradigm. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds) Distributed Computing and Networking. ICDCN 2008. Lecture Notes in Computer Science, vol 4904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77444-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-77444-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77443-3
Online ISBN: 978-3-540-77444-0
eBook Packages: Computer ScienceComputer Science (R0)