A Fast Access Algorithm for Cellular Dynamic Memories
This paper describes a cellular dynamic memory. The structure of the memory is defined by two shuffles g0, g1. The control algorithm of the control unit is obtained from the transition graph of the permutation automaton, which is defined for the memory. The classification of the memory-cells by some equivalence relations leads to a factor automaton with a simplified transition structure. Its states are identified with the address of the memory. Mapping the states into the ℤ2, the control unit decides which shuffle to choose in the next step by looking at the coordinates of the corresponding states. The access algorithm is presented by a flow graph. To show the effectiveness we state the worst case time and the average access time.
KeywordsAccess Time Flow Graph Dynamic Memory Memory Network Connection Pattern
Unable to display preview. Download preview PDF.
- Aho, A.V. and Ullman, J.D.: Dynamic memories with rapid random and sequential accessGoogle Scholar
- Kluge, W.: Cellular dynamic memory array with reduced data-access time Electronics Letters, 1973, pp. 458–460Google Scholar
- Licht, U.: Mathematische Modelle zu nicht-zyklischen Permutationsnetzwerken für dynamische Speicher Diplomarbeit, University of Bonn, 1974Google Scholar
- Stone, H.S.: Dynamic memories with enhanced data access IEEE Trans. Comput., 1972, pp. 359–366Google Scholar