IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-28555-7_7.html
   My bibliography  Save this book chapter

SkvG: Cache-Optimal Parallel Solution of PDEs on High Performance Computers Using Space-Trees and Space-Filling Curves

In: High Performance Computing in Science and Engineering, Garching 2004

Author

Listed:
  • Markus Langlotz

    (TU München, Institut für Informatik)

  • Miriam Mehl

    (TU München, Institut für Informatik)

  • Tobias Weinzierl

    (TU München, Institut für Informatik)

  • Christoph Zenger

    (TU München, Institut für Informatik)

Abstract

Facing the problem of implementing an efficient solver for partial differential equations, we are, in general, confronted with a certain quandary between numerical efficiency and efficiency in the usage of hardware resources: Modern numerical methods require the handling of hierarchical multilevel data on adaptively refined data structures, which are mostly represented by trees. On the other hand, as data access is one of the most important bottlenecks in high performance computing, we would wish to process data linearly with a high locality in time and space to be able to exploit the capability of cache hierarchies. In this paper, we show an approach based on space-filling curves as an odering mechanism for the cells of space-tree grids, with the help of which we can transform our (inherently highly non-local) data respresentation by trees to a few linearly processed data sets. As a consequence, we reach extremely high cache hit-rates above 99, 9%. In addition, the used methods make both parallelization and multigrid algorithms on adaptive grids with hierarchical data very straightforward and efficient.

Suggested Citation

  • Markus Langlotz & Miriam Mehl & Tobias Weinzierl & Christoph Zenger, 2005. "SkvG: Cache-Optimal Parallel Solution of PDEs on High Performance Computers Using Space-Trees and Space-Filling Curves," Springer Books, in: Arndt Bode & Franz Durst (ed.), High Performance Computing in Science and Engineering, Garching 2004, pages 71-81, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-28555-7_7
    DOI: 10.1007/3-540-28555-5_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-28555-7_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.