Abstract
Distributed systems are commonly modeled by asynchronous models where no assumption is made about process execution speed. The asynchronous model is preferable to the synchronous one because the model reflects the fact that a distributed system consists of computers with different processing speeds. However, the asynchrony of the system makes it difficult to evaluate efficiency (performance) of distributed protocols. This paper defines a class of distributed protocols called linear state-transition protocols, in the state-communication model, and shows that efficiency of such protocols in the asynchronous distributed model can be derived from analysis of their synchronous execution, where all processes are synchronized in the lock-step fashion. This provides an effective method for evaluating efficiency of the linear state-transition protocols in the asynchronous distributed model. The paper also demonstrates the effectiveness of the method by applying it to the self-stabilizing alternator.
Work supported in part by JSPS, Grants-in-Aid for Scientific Research ((c)(2)12680349) and by “Priority Assistance for the Formation of Worldwide Renowned Centers of Research - The 21st Century Center of Excellence Program” of the Ministry of Education, Culture, Sports, Science and Technology.
Work supported in part by NSF grant CCR-9733541.
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
M.G. Gouda, F. Haddix: The Alternator. In Proc. Workshop on Self-Stabilizing System(WSS1999), 48–53. (1999) 142, 144, 148, 150
M. G. Gouda, F. Haddix: The Linear Alternator. In Proc. Workshop on Self-Stabilizing System(WSS1997), 31–47 (1997) 148
T. Herman, T. Masuzawa: Self-stabilizing agent traversal. In Proc. Workshop on Self-stabilizing Systems(WSS2001), 152–166. (2001) 144
D. Kondou, H. Masuda, T. Masuzawa: A Self-stabilizing Protocol for Pipelined PIF. In Proc. International Conference on Distributed Computing Systems(ICDCS2002), 181–190. (2002) 144
B. Awerbuch: Complexity of network synchronization. JACM, 32,4, 804–823. (1985) 144
C. Johnen, L. O. Alima, A. K. Datta, S. Tixeuil: Self-stabilizing neighborhood synchronizer in tree networks. In Proc. of the 19th ICDCS, 487–494. (1999) 144
C. Johnen, L. O. Alima, A. K. Datta, S. Tixeuil: Optimal snap-stabilizing neighborhood synchronizer in tree networks. Parallel Processing Letters, 12(3–4), 327–340. (2002) 144
G. M. Brown, M. G. Gouda, C. L. Wu: A self-stabilizing token system. In Proc. of the 20th Annual Hawaii International Conference on System Sciences, 218–223. (1987) 144
G. Tel: Introduction to Distributed Algorithms. Cambridge University Press (the second edition). (2000) 148
S. Dolev: Self-stabilization. The MIT Press. (2000) 148
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakaminami, Y., Masuzawa, T., Herman, T. (2003). A Method for Evaluating Efficiency of Protocols on the Asynchronous Shared-State Model. In: Huang, ST., Herman, T. (eds) Self-Stabilizing Systems. SSS 2003. Lecture Notes in Computer Science, vol 2704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45032-7_11
Download citation
DOI: https://doi.org/10.1007/3-540-45032-7_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40453-8
Online ISBN: 978-3-540-45032-0
eBook Packages: Springer Book Archive