1 / 11

Dijkstra- Scholten and Shavit-Francez termination algorithms

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.

taini
Download Presentation

Dijkstra- Scholten and Shavit-Francez termination algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Dijkstra-Scholtenand Shavit-Francez termination algorithms Rajesh Yadav Kanakabandi

  2. Contents • Introduction • Experimental Setup • Result Analysis • Conclusion • Future Work

  3. 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.

  4. 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.

  5. Number of basic vs. control Messages:

  6. Results and Analysis :1 initiator. Messages Processes

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

  8. Result Analysis :All process are initiators Messages Processes

  9. 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.

  10. 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.

  11. Thank you! Rajesh Yadav Kanakabandi

More Related