Dynamic Memories with Fast Random and Sequential Access

Authors:
H. S. Stone
Affiliations:
Department of Electrical and Computer Engineering, University of Massachusetts
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 3
Cited 5

Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
Dynamic Memories with Rapid Random and Sequential Access

IEEE Transactions on Computers
Dynamic Memories with Enhanced Data Access

IEEE Transactions on Computers

Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations

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
Dynamic memories with faster random and sequential access

IBM Journal of Research and Development
Analysis techniques for SIMD machine interconnection networks and the effects of processor address masks

IEEE Transactions on Computers - Special issue on parallel processors and processing

Quantified Score

Hi-index	14.99

Visualization

Abstract

This paper treats two dynamic memories, one proposed by Aho and Ullman and the other proposed by Stone. The first memory has the property that every item is accessible in 0 (log2 N) steps, and that after access to the first two items of a block of contiguous items, each successive item can be accessed in unit time. In this paper we give a new derivation of the properties, and indicate minor variations and improvements of the memory-access algorithm.