This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Interconnections for Parallel Memories to Unscramble p-Ordered Vectors
November 1974 (vol. 23 no. 11)
pp. 1105-1115
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.
Index Terms:
Array storage allocation, data alignment, group generators, ILLIAC IV, memory interconnections, parallel memories, star polygons.
Citation:
R.C. Swanson, "Interconnections for Parallel Memories to Unscramble p-Ordered Vectors," IEEE Transactions on Computers, vol. 23, no. 11, pp. 1105-1115, Nov. 1974, doi:10.1109/T-C.1974.223817
Usage of this product signifies your acceptance of the Terms of Use.