(<< back)
Distributed Minimum Spanning Tree Finding
Introduction
This project seeks to implement a simple tool that utlizes the distributed minimum spanning tree finding algorithm to evaluate various aspects of clustered compute resources. In this situation, the minimum cost is taken to be the amount of time it takes for a FINDPATH message to be received by an adjacent node. This technique is commonly called flooding.
By adjusting the size and number of discrete messages used to constitute a single communication, we attempt to determine the MST with respect to both bandwidth and latency. The initial implementation assumes a completely connected set of nodes, but it would be just as easy to use custom defined node topologies.
Status
This project has expanded into work on Distributed Finite State Machines Using MPI. Please see it for more detailed information regarding this application.
Links
(<< back)
|