Skip to main content
SpringerLink
Log in

A Fast Access Algorithm for Cellular Dynamic Memories

  • Conference paper
Computer Architecture

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 4))

  • 68 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V. and Ullman, J.D.: Dynamic memories with rapid random and sequential access

    Google Scholar 

  2. Kluge, W.: Cellular dynamic memory array with reduced data-access time Electronics Letters, 1973, pp. 458–460

    Google Scholar 

  3. Licht, U.: Mathematische Modelle zu nicht-zyklischen Permutationsnetzwerken für dynamische Speicher Diplomarbeit, University of Bonn, 1974

    Google Scholar 

  4. Schütt, D.: Shift register graphs and permutation/reset automata Journal of Cybernetics, Vo. 2(4), 1972, pp. 69–73

    Article  MathSciNet  Google Scholar 

  5. Stone, H.S.: Dynamic memories with enhanced data access IEEE Trans. Comput., 1972, pp. 359–366

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Forschungsgruppe Rechnerorganisation und Schaltwerke, Universität Bonn, Wegelerstrasse 6, 5300, Bonn, Germany

    Ulrich Licht

Authors
  1. Ulrich Licht
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Erlangen-Nuremberg, Germany

    W. Händler

  2. Institut für Mathematische Maschinen und Datenverarbeitung (III), Martensstraße 1, D-8520, Erlangen, Germany

    Robert K. Bell M.A.

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Licht, U. (1976). A Fast Access Algorithm for Cellular Dynamic Memories. In: Händler, W., Bell, R.K. (eds) Computer Architecture. Informatik-Fachberichte, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-66400-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-66400-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07761-9

  • Online ISBN: 978-3-642-66400-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation