1 / 11

Performance Comparison of Tarry and Awerbuch Algorithms

Performance Comparison of Tarry and Awerbuch Algorithms. Measurements for performance comparison. Message Complexity Tarry (2 x no of edges) Awerbuch (4 x no of edges) Time Complexity Tarry (2 x no of edges) Awerbuch (4 x no of nodes) – 2. Experiment Setup.

noble-osborne
Download Presentation

Performance Comparison of Tarry and Awerbuch 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. Performance Comparison of Tarry and Awerbuch Algorithms

  2. Measurements for performance comparison • Message Complexity • Tarry (2 x no of edges) • Awerbuch (4 x no of edges) • Time Complexity • Tarry (2 x no of edges) • Awerbuch (4 x no of nodes) – 2

  3. Experiment Setup • Arbitrary graphs are generated for performance measurements • Characteristics of the generated graph • Nodes are randomly generating on a 10x10 graph • No of nodes is determined by the formula no of nodes = density x (100/pi) • Edge exists between 2 nodes if the distance between them is less than 1 • Density is varied from 1 to 10 to increase the number of nodes in the network • Program creates several disconnected graphs of which the largest component is selected as input for experiment.

  4. Experiment and analysis • How the experiment was conducted • Five graphs were generated at each density (varied from 1-10) • A run of both algorithms produced values for message and time complexity. • Each data point on the graph represents an average of the 5 readings. • Entire experiment is repeated for a higher edge to node ratio in the graphs. • Resulting graphs support the expected phenomenon. • Expected Results • For equal node : edge ratio an increase in no of nodes results in better performance for Tarry • For higher edge to node ratio an increase in no of nodes results in better performance for Tarry in terms of Message complexity where as Awerbuch performs better in terms of Time complexity.

  5. Results with arbitrary connected network (equal edge : node)

  6. Results with arbitrary connected network (equal edge : node)

  7. Experiment with network of greater connectivity (higher edge : node)

  8. Experiment with network of greater connectivity (higher edge : node)

  9. Conclusion • Tarry performs better in terms of message complexity than Awerbuch in all kinds of networks, where as for networks with higher connectivity as the network size increases latter shows better performance for time complexity as compared to Tarry

More Related