Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
Digital Signal Analysis
Parallel Substitution Algorithm: Theory and Application
Parallel Substitution Algorithm: Theory and Application
Compilation of CDL for Different Target Architectures
PaCT '95 Proceedings of the 3rd International Conference on Parallel Computing Technologies
FPGA Implementations of the Massively Parallel GCA Model
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15
Generated Horizontal and Vertical Data Parallel GCA Machines for the N-Body Force Calculation
ARCS '09 Proceedings of the 22nd International Conference on Architecture of Computing Systems
A Multiprocessor Architecture with an Omega Network for the Massively Parallel Model GCA
SAMOS '09 Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
The GCA-w Massively Parallel Model
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
A multiprocessor architecture for the massively parallel model GCA
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Multilane single GCA-w based expressway traffic model
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
The massively parallel computing model GCA
Euro-Par 2010 Proceedings of the 2010 conference on Parallel processing
Optimal behavior of a moving creature in the cellular automata model
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Hirschberg's algorithm on a GCA and its parallel hardware implementation
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
A model called global cellular automata (GCA) will be introduced. The new model preserves the good features of the cellular automata but overcomes its restrictions. In the GCA the cell state consists of a data field and additional pointers. Via these pointers, each cell has read access to any other cell in the cell field, and the pointers may be changed from generation to generation. Compared to the cellular automata the neighbourhood is dynamic and differs from cell to cell. For many applications parallel algorithms can be found straight forward and can directly be mapped on this model. As the model is also massive parallel in a simple way, it can efficiently be supported by hardware.