Interconnections for Parallel Memories to Unscramble p-Ordered Vectors

This paper considers the problem of unscrambling vectors when the vectors belong to a class called p-ordered vectors, defined in such a way that elements that should be adjacent in an unscrambled vector are p elements apart in the p- ordered vector.

Abstract

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.