
The MultiProcessor Simulator / Experimental Version 1.0

by Fe'lix E. Quevedo Stuva

Prim's MST Algorithm for a Hypercube machine.

This example uses the interprocess communication feacture, simulating a
Hypercube machine.

The host setups by loading the processor program and sending the dimension
and partition of the graph. Then it waits for the node 0 to send the paths
of the MST.

The process program finds the minimum at each entry level and sends to its
parents. A parent receives from its childs their results and compares to
the one they obtained. The parent selects the smallest, after receiving from
all childs, the smallest one, and send to its parent the results, and so on.
If it is the node 0, it sends the new MST path to the host and the new entry
to its child, and its child to its child, up to the the leaf nodes.
