Abstract
AbstractThere is an increasing interest in the numerical modelling of physical and biological processes using cellular automata or cellular systems. One of the main advantages in using the concept of cellular systems is the inherent high degree of parallelism. The purpose of the contribution is to formally relate two different areas: time‐domain modelling of physical processes using cellular systems and massive parallel implementations. At first, an overview of applications of cellular systems in computation theory and in modelling of physical systems and an overview of implementations of cellular systems is given. The subsequent sections address the following two questions: (1) Which class of algorithms can be interpreted as cellular systems. (2) Can cellular systems be efficiently simulated on a given parallel architecture. Results concerning these issues are presented.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
