By Topic

Interconnections for Parallel Memories to Unscramble p-Ordered Vectors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Swanson, R.C. ; 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.

Published in:

Computers, IEEE Transactions on  (Volume:C-23 ,  Issue: 11 )