Parallel distributed representation of sparse grids using process arrays

  • Michael May
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1184)


In this paper a new data structure for the distributed representation and efficient handling of sparse grids on parallel architectures is introduced. The new data layout is making use of the message passing paradigm and provides dynamic partioning and load balancing transparent to the application making use of it. This way sequential partial differential equations (PDE) solvers based on sparse grids can be data parallelized with hardly any source code modifications.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bungartz, H.: Dünne Gitter und deren Anwendung bei der adaptiven Lösung der dreidimensionalen Poisson-Gleichung Ph.D. Thesis, Technical University of Munich (1992)Google Scholar
  2. 2.
    Nievergelt, J., Hinterberger, H., Sevcik, K. C.: The Grid File: An Adaptable, Symmetric Multikey File Structure ACM Transactions on Database Systems, Vol. 9, No. 1 (1981)Google Scholar
  3. 3.
    Griebel, M.: Parallel Multigrid Methods on Sparse Grids SFB-Bericht Nr. 342/30/90 A, Technical University of Munich (1990)Google Scholar
  4. 4.
    Zenger, C.: Sparse Grids SFB-Bericht Nr. 342/28/90 A, Technical University of Munich (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Michael May
    • 1
  1. 1.Institute of Computer Science Department of Computer Architecture and Computer OrganizationTechnical University of MunichMunichGermany

Personalised recommendations