Structural analysis and implementation of two distributed algorithms

In earlier work, we examined the theoretical effects of synchronization and communication on execution times for different categories of algorithmic structures. The paper demonstrates how two candidate problems for distributed systems can be represented by different algorithmic structures. Specifically, we examine different representations of a partial differential equation (PDE) solver and the travelling salesman problem (TSP). Furthermore, we present results from execution of the algorithms on the Pleiades/ESP System and the Intel Paragon. Using the results from problems executed on real systems, we confirm that our theoretical framework for obtaining bounds on execution time can be used to accurately estimate the performance of a distributed algorithm