IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-69182-2_40.html

Towards Scalable Parallel Numerical Algorithms and Dynamic Load Balancing Strategies

In: High Performance Computing in Science and Engineering, Garching/Munich 2007

Author

Listed:
  • Ralf Hoffmann

    (University of Bayreuth, Department of Mathematics, Physics, and Computer Science)

  • Sascha Hunold

    (University of Bayreuth, Department of Mathematics, Physics, and Computer Science)

  • Matthias Korch

    (University of Bayreuth, Department of Mathematics, Physics, and Computer Science)

  • Thomas Rauber

    (University of Bayreuth, Department of Mathematics, Physics, and Computer Science)

Abstract

Todays most powerful supercomputers utilize thousands of processing elements to gain an overwhelming performance. This development generates an urgent demand for software that can exploit this massive potential for parallelism. Our working group searches for new algorithms and data structures that can make efficient use of the resources provided by modern parallel computer systems. Currently, we focus on three fields, namely parallel solution methods for ordinary differential equations, task-parallel realizations of numerical algorithms, and dynamic load balancing of irregular applications. In this paper, we present an overview of our recent research related to our project on the HLRB II.

Suggested Citation

  • Ralf Hoffmann & Sascha Hunold & Matthias Korch & Thomas Rauber, 2009. "Towards Scalable Parallel Numerical Algorithms and Dynamic Load Balancing Strategies," Springer Books, in: Siegfried Wagner & Matthias Steinmetz & Arndt Bode & Matthias Brehm (ed.), High Performance Computing in Science and Engineering, Garching/Munich 2007, pages 503-516, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-69182-2_40
    DOI: 10.1007/978-3-540-69182-2_40
    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-69182-2_40. 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.