A fast division technique for constant divisors
Communications of the ACM
Electronic Information Processing
Electronic Information Processing
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Dynamic Memories with Rapid Random and Sequential Access
IEEE Transactions on Computers
Interconnections for Parallel Memories to Unscramble p-Ordered Vectors
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Dynamic Memories with Fast Random and Sequential Access
IEEE Transactions on Computers
A Shuffle-Exchange Network with Simplified Control
IEEE Transactions on Computers
Dynamic Memories with Enhanced Data Access
IEEE Transactions on Computers
A Combinatoric Division Algorithm for Fixed-Integer Divisors
IEEE Transactions on Computers
Dynamic memories with faster random and sequential access
IBM Journal of Research and Development
Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations
IEEE Transactions on Computers
Dynamic Memory Interconnections for Rapid Access
IEEE Transactions on Computers
Hi-index | 14.99 |
Aho and Ullman have proposed an access mechanism for dynamic memories by which each item of a block after the first two can be accessed in a single step. Recently, this organization has been enhanced by Stone, whose memory scheme allows, on the average, random access in 1.5 log2 n steps; whereas, in the case of a sequential access, a single step is required for each item after the first. However, both methods can only be used for memories of size n = 2k - 1. We generalize Stone's technique in order to eliminate this severe restriction. The very large number of solutions that can be obtained for each memory size implies that an optimization procedure is valuable if the cost constraints of a particular implementation are known.