Linear speedup of two-dimensional neighborhood functions requires that the underlying processor perform iterative operations and solve the window border problem simultaneously. The authors illustrate a solution to the window border problem using an array processor that provides conflict-free access and alignment of two types of square block vectors of two-dimensional arrays. They give a parallel algorithm embodying this solution, which can speedup a class of neighborhood functions by a factor directly proportional to the number of processing elements in the array processor. >
['De-Lei Lee', 'Wayne A. Davis']
On linear speedup of a class of neighborhood functions in an array processor