Memory and algebra
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.
KeywordsCayley Graph Address Space Central Unit Complex Data Structure Metacyclic Group
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- H.S.M. Coxeter and W.O.J. Moser, Generators and relations for discrete groups, Springer-Verlag, 1957.Google Scholar
- P.M. Fenwick, Addressing operations for automatic data structure accessing, Computer Architecture News, pp. 44–57, vol. 12, no. 1, march 1984.Google Scholar
- M. Garzon, Cyclic automata, Theoretical Computer Science, vol. 53, pp. 307–317, 1987.Google Scholar
- D.L. Johnson, Topics in the theory of group presentations, Cambridge University Press, 1980.Google Scholar
- C. Jousselin, Nouvelle arithmétique d'accès mémoire, Revue Annuelle LEP, 1987.Google Scholar
- D.E. Knuth, The art of computer programming, vol. 1, Addison-Wesley, 1968.Google Scholar
- W. Magnus, A. Karrass and D. Solitar, Combinatorial group theory, Interscience, 1966.Google Scholar
- A.L. Rosenberg, Data graphs and addressing schemes, J. Comp. Syst. Sci., vol. 5, pp. 193–238, 1971.Google Scholar