Cellular automata: energy consumption and physical feasibility

Authors:
Peter Sanders;Roland Vollmar;Thomas Worsch
Affiliations:
Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany;Universität Karlsruhe, Fakultät für Informatik, 76128 Karlsruhe, Germany;Universität Karlsruhe, Fakultät für Informatik, 76128 Karlsruhe, Germany
Venue:
Fundamenta Informaticae - Special issue on cellular automata
Year:
2002

Citing 12
Cited 0

A model of computation for VLSI with related complexity results

Journal of the ACM (JACM)
Three dimensional circuit layouts

SIAM Journal on Computing
Energy consumption in VLSI circuits

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Upper and lower bounds on switching energy in VLSI

Journal of the ACM (JACM)
VLSI theory

Handbook of theoretical computer science (vol. A)
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
Feynman Lectures on Computation

Feynman Lectures on Computation
Physics and the New Computation

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Lower bounds for VLSI

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
The entropic limitations on VLSI computations(Extended Abstract)

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using cellular automata as models of parallel machines we investigate constraints for the energy consumption of r-dimensional machines which are motivated by physical limitations for the case r = 3. Depending on the operations which must be considered to dissipate energy, some relations between the relative performance of 2-dimensional and 3-dimensional machines are derived. In the light of these results it seems imperative that for feasible models of computation energy consumption has to be considered as an additional complexity measure.