GCA: Global Cellular Automata. A Flexible Parallel Model
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Parallel Merge Sort on Concurrent-Read Owner-Write PRAM
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Parallel algorithms for the transitive closure and the connected component problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
A multiprocessor architecture for the massively parallel model GCA
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The GCA-w Massively Parallel Model
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
| Hi-index | 0.00 |
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg's algorithm which determines the connected components of a n-node undirected graph with time complexity O(n log n). This algorithm is implemented fully parallel in hardware (FPGA logic). The complexity of the logic and the performance is evaluated and compared to a former implementation using n(n+1) cells with a time complexity of O(log2(n)). It can be seen from the implementation that the presented algorithm needs significantly fewer resources (logic elements times computation time) compared to the implementation with n(n + 1) cells, making it preferable for graphs of reasonable size.