Complexity of network synchronization
Journal of the ACM (JACM)
Self-stabilization
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilizing Agent Traversal
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
A Self-Stabilizing Protocol for Pipelined PIF in Tree Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Self-Stabilizing Neighborhood Synchronizer in Tree Networks
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
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.