Optimal speed up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory

The authors propose two parallel template matching algorithms for hypercube multiprocessors with restricted local memory. Using the Gray code mapping, they reduce the communication overhead involved in the execution of template matching algorithms. Both algorithms have been shown to be optimal speed up.<
>