Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Synchronizing ABD networks
By: Tel, G.; Zaks, S.; Korach, E.;
1994 / IEEE
This item was taken from the IEEE Periodical ' Synchronizing ABD networks ' Chou et al. (1990) presented two synchronizer algorithms for ABD networks. One of their synchronizers has a round time of three, and the other has a round time of only two but requires an additional bit in every message of the simulated algorithm. The authors show that ABD synchronization can be improved by using information that can be obtained, without exchanging more messages, during the initialization of the synchronizers. The authors first contribution is a synchronizer with a round time of two that does not require an additional bit in basic messages. The second result refutes the common belief that a round time of two is the best achievable for this type of synchronizer. They show that in some network topologies a smaller round time is achievable by making the local time of simulation of the pulses dependent on the arrival time of messages received during initialization. The correctness of the synchronizers is shown by modeling this class of synchronizers as functions, and using these functions lower bounds on the round time can also be easily obtained. The authors show that their synchronizers are optimal, i.e., further reduction of the round time by the same means is not possible.<
Asynchronous Bounded Delay Networks
Algorithm Design And Analysis
Computing And Processing
Communication, Networking And Broadcast Technologies