An introduction to parallel algorithms
An introduction to parallel algorithms
Practical Pram Programming
Parallel Substitution Algorithm: Theory and Application
Parallel Substitution Algorithm: Theory and Application
GCA: Global Cellular Automata. A Flexible Parallel Model
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
GCA: A Massively Parallel Model
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Implementation of the Massively Parallel Model GCA
PARELEC '04 Proceedings of the international conference on Parallel Computing in Electrical Engineering
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 for the massively parallel model GCA
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Multilane single GCA-w based expressway traffic model
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Efficient minimal routing in the triangular grid with six channels
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Hi-index | 0.00 |
We introduce the GCA-w model (Global Cellular Automata with write access) that is an extension of the GCA (Global Cellular Automata) model, which is in turn an extension of the cellular automata (CA) model. All three models are called "massively parallel" because the models are based on cells that are updated synchronously in parallel. In the CA model, the cells have static links to their local neighbors whereas in the GCA model, the links are dynamic to any global neighbor. In both models, the access is "read-only". Thereby no write conflict can occur which reduces the complexity of the model and its implementation. The GCA model can be used for many parallel problems that can be described with a changing global (or locally restricted) neighborhood. The main restriction of the GCA model is the forbidden write access to neighboring cells. Although the write access can be emulated in O(log n) time this slowdown is not desired in practical applications. Therefore, the GCA-w model was developed. The GCA-w model allows to change the state of the own cell as well as the states of the neighboring cells. Thereby parallel algorithms can be executed faster and the activity of the cells can be controlled in order, e.g., to reduce power consumption or to use inactive cells for other purposes. The application of the GCA-w model is demonstrated for some parallel algorithms: pointer inversion, sorting with pointers, synchronization and Pascal's triangle. In addition, a hardware architecture is outlined which can execute this model.