Parallel and distributed processing of cellular hypergraphs
In this paper it will be explained how cellular hypergraphs (CHG) can be easily distributed to a network of processor nodes. Replacement systems (CHGRS) can be used to describe the dynamics of a CHG. A CHGRS can operate in a conflict-free and synchronous-parallel manner and it can be implemented in a multiprocessor system with little overhead. As a consequence CHGRS can be used as abstract models for many natural phenomena and can support the efficient simulation on a multiprocessor system.
The two major questions will be discussed: How a CHGRS can be implemented distributively, even if it contains complex replacement rules. And how load balancing can be performed using a non-supervised algorithm.
Unable to display preview. Download preview PDF.
- 1.P. Hartmann. Parallel Replacement Systems on Geometric Hypergraphs: A Mathematical Tool for Handling Dynamic Geometric Sceneries. Proceedings of the VIth International Workshop on Parallel Processing by Cellular Automata and Arrays, PARCELLA Workshop Potsdam, 12:81–90, September 1994.Google Scholar
- 2.P. Hartmann. Parallel Replacement Systems on Hierarchically Structured Hypergraphs: A new Method for Modelling Dynamic Geometric Sceneries, pages 235–240. Proceedings of the 5th International Workshop on Graph Grammars and their Application to Computer Science, Williamsburg Virginia, November 1994.Google Scholar
- 3.P. Hartmann. Efficient Subgraph Matching within Cellular Hypergraphs. Accepted for: Second International Conference on Developments in Language Theory, Magdeburg, Germany, 1995.Google Scholar
- 4.T. Toffoli and N. Margolus. Cellular Automata Machines. MIT Press, 1987.Google Scholar
- 5.R. Vollmar. Algorithmen in Zellularautomaten. Teubner-Verlag, 1979.Google Scholar