Issue No. 11 - November (1974 vol. 23)
R.C. Swanson , Department of Computer Science, Digital Systems Laboratory, Stanford University
Several methods have been considered for storing arrays in a parallel memory system so that various useful partitions of an array can be fetched from the memory with a single access. Some of these methods fetch vectors in an order scrambled from that required for a computation. This paper considers the problem of unscrambling such vectors when the vectors belong to a class called p-ordered vectors. This class of vectors is defined in such a way that elements that should be adjacent in an unscrambled vector are p elements apart in the p-ordered vector.
Array storage allocation, data alignment, group generators, ILLIAC IV, memory interconnections, parallel memories, star polygons.
R. Swanson, "Interconnections for Parallel Memories to Unscramble p-Ordered Vectors," in IEEE Transactions on Computers, vol. 23, no. , pp. 1105-1115, 1974.