Parallel implementation of the Kohonen algorithm on transputer

A parallel implementation of the Kohonen algorithm is proposed using partitioning of the network. This allows an exact implementation of the Kohonen algorithm as opposed to partitioning the data. By using a simple routing strategy the parallel Kohonen algorithm was tested on a PC-based transputer network without the need for any special distributed operating system. The execution time was measured for networks of different size and a varying number of transputers. The execution time decreased as the number of transputers increased. However, for comparatively small-size neural networks the communication overhead caused the execution time to increase when more transputers were used. Thus, the proposed parallel implementation of the Kohonen algorithm is not suitable for massively parallel architectures. It is concluded that in excess of 12 transputers can be used with network sizes of the order of 3000 neurons or more but no more than six transputers can be used with network sizes of the order of 120 neurons