Skip to main content
SpringerLink
Log in

Parallel and distributed processing of cellular hypergraphs

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 964))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

Download references

Author information

Authors and Affiliations

  1. Fachgebiet Mikroprogrammierung Fachbereich Informatik, TH Darmstadt, Alexanderstraße 10, D-64283, Darmstadt, Germany

    Peter Hartmann

Authors
  1. Peter Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hartmann, P. (1995). Parallel and distributed processing of cellular hypergraphs. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1995. Lecture Notes in Computer Science, vol 964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60222-4_97

Download citation

  • DOI: https://doi.org/10.1007/3-540-60222-4_97

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60222-4

  • Online ISBN: 978-3-540-44754-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation