DATA DISTRIBUTION AND ALIGNMENT SCHEME FOR CONFLICT-FREE MEMORY ACCESS IN PARALLEL IMAGE-PROCESSING SYSTEM

In this paper, we give a solution to the problem of conflict-free acce ss of various slices of data in parallel processor for image processin g. Image processing operations require a memory system that permits pa rallel and conflict-free access of rows, columns, forward diagonals, b ackward diagonals, and blocks of two-dimensional image array for an ar bitrary location. Linear skewing schemes are useful methods for those requirements, but these schemes require complex Euclidean division by prime number. On the contrary, nonlinear skewing schemes such as XOR-s chemes have more advantages than the linear ones in address generation , but these schemes allow conflict-free access of some array slices in restricted region. In this paper, we propose a new XOR-scheme which a llows conflict-free access of arbitrarily located various slices of da ta for image processing, with a two-fold the number of memory modules than that of processing elements. Further, we propose an efficient dat a alignment network which consists of log N + 2-stage multistage inter connection network utilizing Omega network.