Make your own free website on Tripod.com

The Simplest Cluster Machine

This may be the simplest example of clustering technique.

 

FOR K=1 to 10: REM performed by node 3

       FOR J=1 to 10: REM performed by node 2

                FOR I=1 to 10: REM performed by node 1

                NEXT I

                OUTPUT WHEN DONE

        NEXT J

        OUTPUT WHEN DONE

NEXT K

OUTPUT WHEN DONE: REM signal node 0 that operation is finished.

 

This is NOT meant to be a practical example. Node 1 (by node we mean a separate machine)  just counts from 1 to 10. The other nodes wait (but in practice would be doing something useful) until there is a signal that something has been completed, then adds one to its loop counter. While that is happening, the previous node has already started counting through its loop again.

In practice the heaviest computing load would be asigned to the fastest machine, in this case node 1. Node 1 has counted to a total of 1000, Node 2 counted a hundred times and node 3 only ten times.  

Note that in at least this example there is little communications between nodes and a serial port link would do just fine.

A more practical example might be the manipulation and combining of several graphics. Several bytes might be transmitted to another node as input to its operation. Data tables might be entered into its node by floppy. The final results could be sent to a floppy or hard drive file for retieval or debugging purposes.

 Supercomputers are only good for a task if the task can be broken down in smaller tasks. This is true of ALL cluster type machines and parallel operations.