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

摘要

The authors propose two parallel template matching algorithms forhypercube multiprocessors with restricted local memory. Using the Graycode mapping, they reduce the communication overhead involved in theexecution of template matching algorithms. Both algorithms have beenshown to be optimal speed up