Scrambled storage for parallel memory systems
Decky B. Lee · ACM SIGARCH Computer Architecture News · 1988
A scrambled storage scheme is proposed for storing arrays of NXN elements in N = 2 n parallel memory modules to allow conflict-free access to various array partitions. It is shown that the scheme allows conflict-free access to rows, columns, square blocks, and distributed blocks of stored arrays. An alternative way of achieving the desired accessibility would use Budnik and Kuck's nonuniform skewed storage [3]; in this case, addressing hardware would require Ο( n X2 n ) exclusive-or circuits. The proposed scheme has, however, the advantage of simplifying address generation; addressing hardware requires n exclusive-or circuits only. Some of the important questions of scrambling/unscrambling data through a proposed interconnection network are discussed.