A fast sequential distributed synchronization protocol
Akihiro Fujii, Makoto Nakamura, Yoshiaki Nemoto · Systems and Computers in Japan · 1998
Achieving synchronization which occurs continuously with the change of situations in a distributed system is an important control functionality for a wide range of applications. In this paper, recognition of locally occurring events is defined as one action of “synchronization.” Then, the constant occurrences of events are treated as “continuous synchronization.” We propose a distributed algorithm which correctly achieves “continuous synchronization.” Next, we analyze the time complexity which is necessary to process continuous synchronization. The analysis is done for the situation where the transmission delay has an exponential probability distribution. The result shows the lower bound of the average processing time for one synchronization as well as the highest capability to obtain continuous synchronization. Under the assumptions of Poisson arrival of continuous requests for synchronization, the maximum average throughput is estimated by the analysis. The effects of changes of the transmission delay are also analyzed. © 1998 Scripta Technica, Syst Comp Jpn, 29(12): 11–18, 1998