On Access and Alignment of Data in a Parallel Processor

Abstract We describe a complete solution to the problem of parallel, conflict-free access and alignment of rows, columns, forward and backward diagonals of an N×N matrix in a parallel processor with N processing elements sharing N memory modules via an interconnection network, where N=2n with any n > 1 .

[1]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

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

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

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

[5]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

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