Speed up performances on MIMD machines

The authors describe the implementation of a second-order backpropagation algorithm for pattern recognition on a PC, an INMOS transputer network, and Intel hypercubes. The approach was to parallelize a sequential program by identifying the parts of the sequential code that can be executed in parallel and distributing these parts evenly among available processors in the network. The trade-off between communication and computation was investigated. The speedup concurrency is given with respect the number of processors in terms of a sigmoidallike curve.<<ETX>>