Dynamic Memories with Fast Random and Sequential Access
- 1 December 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (12) , 1167-1174
- https://doi.org/10.1109/t-c.1975.224160
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.Keywords
This publication has 3 references indexed in Scilit:
- Dynamic Memories with Rapid Random and Sequential AccessIEEE Transactions on Computers, 1974
- Dynamic Memories with Enhanced Data AccessIEEE Transactions on Computers, 1972
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971