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.
Similar content being viewed by others
Literatur
Arbib, M. A.: Theories of abstract automata. Englewood Cliffs (N.J.): Prentice-Hall 1969
Hotz, G.: Informatik: Rechenanlagen. Teubner Studienbuch. Stuttgart: Teubner 1972
Hotz, G., Walter, H.: Automatentheorie und Formale Sprachen, Bd. I, II. Mannheim: Bibliographisches Institut 1968
Spira, P.M.: The time required for group multiplication. J. ACM 16, 235–243 (1969)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kaufholz, G. Über die Vernetzungsstruktur von maschinen. Acta Informatica 3, 171–186 (1974). https://doi.org/10.1007/BF00264036
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264036