Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1989: Mathematical Foundations of Computer Science 1989 pp 305–313Cite as

Memory and algebra

  • Communications
  • Conference paper
  • First Online:

  • 146 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 379))

Abstract

Memory in the von Neumann computer is usually viewed as a linear array. We prove that this view does not follow from the consecutive nature of this memory, but from the group structure of the law performed in the address arithmetic unit. By changing that law, we can get a memory with a non commutative access. As an example we describe the metacyclic memory.

A member of PHILIPS Research Organization.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.B. Akers and B. Krishnamurthy, Group graphs as interconnection networks, proc. 14th IEEE symposium on Fault-Tolerant Computing, pp. 422–427, june 1984.

    Google Scholar 

  2. A. Asthanen, H.V. Jagadish, J.A. Chandross, D. Lin, S.C. Knauer, An intelligent memory system, Computer Architecture News, pp. 12–20, vol. 16, no. 4, september 1988.

    Google Scholar 

  3. J. Backus, Can programming be liberated from the von Neumann style? A functional style and its algebra of programs, CACM, vol. 21, no. 8, pp. 613–641, august 1978.

    Google Scholar 

  4. H.S.M. Coxeter and W.O.J. Moser, Generators and relations for discrete groups, Springer-Verlag, 1957.

    Google Scholar 

  5. P.M. Fenwick, Addressing operations for automatic data structure accessing, Computer Architecture News, pp. 44–57, vol. 12, no. 1, march 1984.

    Google Scholar 

  6. M. Garzon, Cyclic automata, Theoretical Computer Science, vol. 53, pp. 307–317, 1987.

    Google Scholar 

  7. D.L. Johnson, Topics in the theory of group presentations, Cambridge University Press, 1980.

    Google Scholar 

  8. C. Jousselin, Nouvelle arithmétique d'accès mémoire, Revue Annuelle LEP, 1987.

    Google Scholar 

  9. D.E. Knuth, The art of computer programming, vol. 1, Addison-Wesley, 1968.

    Google Scholar 

  10. W. Magnus, A. Karrass and D. Solitar, Combinatorial group theory, Interscience, 1966.

    Google Scholar 

  11. A.L. Rosenberg, Data graphs and addressing schemes, J. Comp. Syst. Sci., vol. 5, pp. 193–238, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoires d'Electronique et de Physique appliquée, 94450, Limeil-Brévannes, France

    C. Jousselin & J -P. Moskowitz

Authors
  1. C. Jousselin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J -P. Moskowitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Kreczmar Grazyna Mirkowska

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jousselin, C., Moskowitz, J.P. (1989). Memory and algebra. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-51486-4_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51486-2

  • Online ISBN: 978-3-540-48176-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation