
The MultiProcessor Simulator / Experimental Version 1.0

by Fe'lix E. Quevedo Stuva

Maximum Finding Algorithm for a Binary Tree machine, mapped on a
Linear Array Computer.

This example uses the interprocess communication feature. It also simulates
the mapping of a Binary Tree Machine on a simulated Linear Array Computer.
The algorithm is known to be Cost Optimal.

The host program prepares data, load to all the processor available the
processor program and send to each one the assigned partition. Finally
waits for the result as a messages from the root processor.

The processor program receives the partition, finds the maximum and send
the result to its parent. At this moment the mapping of a  binary tree
machine on a linear array computer, proposed by Sarkar and Deo [1988], enters
in effect. Depending on the stage algorithm it will receive, process and
send; or will receive and send. Finally if the processor is the mapped root
of the binary tree, send the result to the host process.

The output attached to the implementation, shows step by step how the
communication is performed. Observe how the execution of the processors (nodes)
are completely asynchronical at the begining.
