Mapping schemes for sequential image processing algorithms

Abstract

Two mapping schemes for the parallel implementation of a wide class of intrinsically sequential image processing algorithms are proposed. Their theoretical efficiency is discussed, and the convenience of using each of them evaluated as a function of the image size. Experimental results obtained on a commercial massively parallel computer are illustrated and compared with those achieved with the sequential implementation of the algorithm.