Abstract
The realisation of Global Cellular Automaton (GCA) using a comparatively high number of communicating finite state machines (FSM) leads to high communication effort. Inside configurable architectures, fixed numbers of FSM and fixed bus widths result in a granularity that makes mapping of larger GCA to these architectures even more difficult. This approach presents a configurable architecture to support mapping of GCA into a single Boolean network to omit increasing communication effort and to receive scalability as well as high efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hoffmann, R., Völkmann, K.-P., Heenes, W.: Globaler Zellularautomat (GCA): Ein neues massivparalleles Berechnungsmodell. Mitteilungen – Gesellschaft für Informatik e.V., Parallel-Algorithmen und Rechnerstrukturen, pp. S. 21–28 (2001) (in German language) ISSN 0177-0454 Nr. 18
Brayton, R.K., et al.: Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic Publishers, Dordrecht (1984)
Trapp, M.: PLD-design methods migrate existing designs to high-capacity devices. EDN Access (February 1994)
Heenes, W., Hoffmann, R., Völkmann, K.-P.: Architekturen für den globalen Zellularautomaten. In: 19th PARS Workshop, Basel (March 2003) (in German language), http://www.ra.informatik.tu-darmstadt.de/publikationen/pars03.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiegand, C., Siemers, C., Richter, H. (2004). Definition of a Configurable Architecture for Implementation of Global Cellular Automaton. In: Müller-Schloer, C., Ungerer, T., Bauer, B. (eds) Organic and Pervasive Computing – ARCS 2004. ARCS 2004. Lecture Notes in Computer Science, vol 2981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24714-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-24714-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21238-6
Online ISBN: 978-3-540-24714-2
eBook Packages: Springer Book Archive