Cellular Automata with Dynamically Reconfigurable Buses

Authors:
Thomas Worsch
Affiliations:
-
Venue:
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Year:
1999

Citing 8
Cited 0

Meshes with reconfigurable buses

Proceedings of the fifth MIT conference on Advanced research in VLSI
The difference between one tape and two tapes: with respect to reversal complexity

Theoretical Computer Science
The power of reconfiguration

Journal of Parallel and Distributed Computing
Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
The complexity of reconfiguring network models

Information and Computation
The DMBC: architecture and fundamental operations

ICS '95 Proceedings of the 9th international conference on Supercomputing
On the power of segmenting and fusing buses

Journal of Parallel and Distributed Computing
Polymorphic Processor Arrays

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider one-dimensional cellular automata which are extended by dynamically reconfigurable buses (RCA). It is shown that up to a constant factor it does not matter whether bus segments are directed or not. For both variants of the model their time complexity can be characterized in terms of the reversal complexity of one-tape TM. The comparison of RCA with tree CA shows that the former are in the second machine class and that they can be transformed in some normal form with an only polynomial overhead of time.