Dijkstra-Scholten and Shavit-Francez termination algorithms Rajesh Yadav Kanakabandi

Contents Introduction Experimental Setup Result Analysis Conclusion Future Work

Introduction Dijkstra-Scholten’s algorithm works on networks with one initiator. When a process with no parent receives a <MSG> it sets the sender as parent. sends <SIG> to the sender if it already has a father. Termination is detected when the entire tree colapses. Shavit-Francez generalized Dijkstra – Scholten to decentralized networks. Each initiator maintains its own tree. Termination is detected using another single wave.

Experimental Setup Base algorithm: Random flood. Simple Echo algorithm runs on top of the base algorithm. Terminates when Echo algorithm decides. Total control messages(<SIG>) are counted. Experimenting on fully connected, star and ring topologies.

Number of basic vs. control Messages:

Results and Analysis :1 initiator. Messages Processes

Results and Analysis :1/2 of the process are initiators Messages Processes

Result Analysis :All process are initiators Messages Processes

Conclusion Number of <SIG>s was increasing along with the number of processes. Star and ring topologies being interesting by nature, their results differed from that of fully connected. Number of <SIG>s has always been comparable to the number of basic messages.

Future Work Perform the analysis on other topologies like tree. Test with higher number of processes. Run the detection algorithm on random algorithms. To determine the difference in <SIG> until message termination and proper termination.

Rajesh Yadav Kanakabandi Thank you! Rajesh Yadav Kanakabandi