Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Dynamic Memories with Rapid Random and Sequential Access
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
The Generation of Permutations in Magnetic Bubble Memories
IEEE Transactions on Computers
Dynamic Memories with Enhanced Data Access
IEEE Transactions on Computers
Fast Random and Sequential Access to Dynamic Memories of Any Size
IEEE Transactions on Computers
Dynamic Memory Interconnections for Rapid Access
IEEE Transactions on Computers
| Hi-index | 0.01 |
This paper extends the dynamic memory proposed by Aho and Ullman in two directions. Instead of a shuffle permutation, block shuffles are introduced. By choosing suitable block sizes, faster random and sequential access may result. Another direction of extension comes from the addition of a reverse cyclic permutation, which results in even faster random and sequential access. Analyses for both the worst and the average cases are given. Generalizations to arbitrary radices are also discussed.