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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster. The power of recon guration. Journal of Parallel and Distributed Computing, 13(2):139–153, 1991.
Y. Ben-Asher, K.-J. Lange, D. Peleg, and A. Schuster. The complexity of reconfiguring network models. Information and Computation, 121:41–58, 1995.
J. Chen. The difference between one tape and two tapes: with respect to reversal complexity. Theoretical Computer Science, 73:265–278, 1990.
A. Fellah and S. Yu. Iterative tree automata, alternating Turing machines, and uniform boolean circuits: Relationships and characterizations. In H. Berghel et al., eds., Proc. Symposium on Applied Computing. Volume 2, p. 1159–1166, 1992.
M. Maresca. Polymorphic Processor Arrays. IEEE Transactions on Parallel and Distributed Systems, 4:490–506, 1993.
R. Miller, V. K. Prasanna-Kumar, D. Reisis, Q. F. Stout. Meshes with reconfigurable buses. In Proc. Conf. on Advanced Research in VLSI, p. 163–178, 1988.
J. M. Moshell and J. Rothstein. Bus automata and immediate languages. Information and Control, 40:88–121, 1979.
J. Mycielski and D. Niwiński. Cellular automata on trees, a model for parallel computation. Fundamenta Informaticae, XV:139–144, 1991.
J. Rothstein. On the ultimate limitations of parallel processing. In P. H. Enslow Jr., ed., Proc. Int. Conf. on Parallel Processing, p. 206–212, 1976.
S. Sahni. The DMBC: Architecture and fundamental operations. In Proc. Int. Conf. on Supercomputing, p. 60–66, ACM Press, 1995.
J. L. Trahan, R. Vaidyanathan, R. K. Thiruchelvan. On the power of segmenting and fusing buses. Journal of Parallel and Distributed Computing, 34:82–94, 1996.
J. Wiedermann. Paraleln´y Turingov stroj — Model distribuovaného počítača. In J. Gruska, ed., Distribouvané a parallelné systémy, p. 205–214. Bratislava, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Worsch, T. (1999). Cellular Automata with Dynamically Reconfigurable Buses. In: Pavelka, J., Tel, G., Bartošek, M. (eds) SOFSEM’99: Theory and Practice of Informatics. SOFSEM 1999. Lecture Notes in Computer Science, vol 1725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47849-3_37
Download citation
DOI: https://doi.org/10.1007/3-540-47849-3_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66694-3
Online ISBN: 978-3-540-47849-2
eBook Packages: Springer Book Archive