Abstract
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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
