Advertisement

Acta Informatica

, Volume 3, Issue 2, pp 171–186 | Cite as

Über die Vernetzungsstruktur von maschinen

  • Gerd Kaufholz
Article

Summary

By adding some technologically motivated postulates to the definition of finite automata, we gain a mathematical model which permits interesting insights into the network structure of computing machines. In particular we show that the design of a strongly wired part (CPU) and a weakly wired part (storage) is advisable from the viewpoint of cost minimisation. We can also deduce some results about the interdependence of wiring density and computation time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. 1.
    Arbib, M. A.: Theories of abstract automata. Englewood Cliffs (N.J.): Prentice-Hall 1969Google Scholar
  2. 2.
    Hotz, G.: Informatik: Rechenanlagen. Teubner Studienbuch. Stuttgart: Teubner 1972Google Scholar
  3. 3.
    Hotz, G., Walter, H.: Automatentheorie und Formale Sprachen, Bd. I, II. Mannheim: Bibliographisches Institut 1968Google Scholar
  4. 4.
    Spira, P.M.: The time required for group multiplication. J. ACM 16, 235–243 (1969)Google Scholar

Copyright information

© Springer-Verlag 1974

Authors and Affiliations

  • Gerd Kaufholz
    • 1
  1. 1.Fachbereich Angewandte Mathematik und Informatik der Universität des SaarlandesSaarbrückenBundesrepublik Deutschland

Personalised recommendations