On Pipeline Realizations of Dynamic Memories

  • Paul Mies
  • Dieter Schütt
Conference paper
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 4)


The paper describes decompositions of dynamic memories into chains of 2-cell memories.


Dynamic Memory Interconnection Pattern Pipeline Element Cascade Product Permutation Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho, A.V. and Ullman, J.D.: Dynamic memories with rapid random and sequential access Bell Laboratories/Princeton University, 1972Google Scholar
  2. [2]
    De Bruijn, N.G.: A combinatorial problem Proceedings Koninklijke Nederlands Akademie van Wetenschappen, 1946, pp. 758–764Google Scholar
  3. [3]
    Kluge, W.: Cellular dynamic memory array with reduced data-access time Electronics Letters, 1973, pp.458–460Google Scholar
  4. [4]
    Licht, U.: Mathematische Modelle zu nicht-zyklischen Permutationsnetzwerken für dynamische Speicher Dipiomarbeit, University of Bonn, 1974Google Scholar
  5. [5]
    Schlitt, D.: Ober Schieberregistergraphen und-Realisierungen GMD Report No. 34, Bonn, 1970Google Scholar
  6. [6]
    Schlitt, D.: Shift register graphs and permutation/reset automata Journal of Cybernetics, Vol. 2(4), 1972, pp. 69–73MathSciNetCrossRefGoogle Scholar
  7. [7]
    Stone, H.S.: Dynamic memories with enhanced data access IEEE Trans. Comput., 1972, pp.359–366Google Scholar
  8. [8]
    Kautz, W.H.: Shift register memories IEEE Comp. Soc. Repository Service, 1972Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1976

Authors and Affiliations

  • Paul Mies
    • 1
  • Dieter Schütt
    • 1
  1. 1.Informatik IUniversity of BonnBonnGermany

Personalised recommendations