Parallel memory systems for image processing

A novel memory system is proposed for image processing. Latin squares, which are well known combinatorial objects, are used as the skew function of the memory system. A Latin square with desired properties for image-array access is introduced. The resulting memory system provides access to various subsets of image data (rows, columns, diagonals, main subsquares, etc.) without memory conflict. The memory modules are fully utilized for most frequently used subsets of image data. The address generation can be performed in constant time. This memory system achieves constant-time access to rows, columns, diagonals, and subarrays using a minimum number of memory modules.<<ETX>>

[1]  Ashoke Deb,et al.  Conflict-Free Access of Arrays - A Counter Example , 1980, Inf. Process. Lett..

[2]  V. K. Prasanna-Kumar,et al.  Perfect Latin squares and parallel array access , 1989, ISCA '89.

[3]  Paul Budnik,et al.  The Organization and Use of Parallel Memories , 1971, IEEE Transactions on Computers.

[4]  David J. Kuck.  ILLIAC IV Software and Application Programming , 1968, IEEE Transactions on Computers.

[5]  Jong Won Park.  An Efficient Memory System for Image Processing , 1986, IEEE Trans. Computers.

[6]  J. Dénes,et al.  Latin squares and their applications , 1974 .

[7]  Cauligi S. Raghavendra,et al.  On Array Storage for Conflict-Free Memory Access for Parallel Processors , 1988, International Conference on Parallel Processing.

[8]  Ervin Gergely,et al.  A Simple Method for Constructing Doubly Diagonalized Latin Squares , 1974, J. Comb. Theory, Ser. A.

[9]  Jan van Leeuwen,et al.  The Structure of Periodic Storage Schemes for Parallel Memories , 1985, IEEE Transactions on Computers.

[10]  Henry D. Shapiro,et al.  Theoretical Limitations on the Efficient Use of Parallel Memories , 1978, IEEE Transactions on Computers.

[11]  De-Lei Lee.  Scrambled storage for parallel memory systems , 1988, ISCA '88.

[12]  Jong Won Park.  An Efficient Memory System for Image Processing , 1986, IEEE Transactions on Computers.

[13]  Mateo Valero,et al.  Partitioning: An Essential Step in Mapping Algorithms Into Systolic Array Processors , 1987, Computer.

[14]  A. Hedayat.  A Complete Solution to the Existence and Nonexistence of Knut Vik Designs and Orthogonal Knut Vik Designs , 1977, J. Comb. Theory, Ser. A.

[15]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[16]  Jan van Leeuwen,et al.  On Linear Skewing Schemes and d-Ordered Vectors , 1987, IEEE Transactions on Computers.

[17]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[18]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.

[19]  David C. van Voorhis,et al.  Memory Systems for Image Processing , 1978, IEEE Transactions on Computers.