High Performance Multigrid on Current Large Scale Parallel Computers
| dc.contributor.author | Gradl, Tobias | |
| dc.contributor.author | Rüde, Ulrich | |
| dc.contributor.editor | Nagel, Wolfgang E. | |
| dc.contributor.editor | Hoffmann, Rolf | |
| dc.contributor.editor | Koch, Andreas | |
| dc.date.accessioned | 2019-05-06T10:35:47Z | |
| dc.date.available | 2019-05-06T10:35:47Z | |
| dc.date.issued | 2008 | |
| dc.description.abstract | Making multigrid algorithms run efficiently on large parallel computers is a challenge. Without clever data structures the communication overhead will lead to an unacceptable performance drop when using thousands of processors. We show that with a good implementation it is possible to solve a linear system with 1011 unknowns in about 1.5 minutes on almost 10,000 processors. The data structures also allow for efficient adaptive mesh refinement, opening a wide range of applications to our solver. | en |
| dc.identifier.isbn | 978-3-88579-218-5 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/22274 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e. V. | |
| dc.relation.ispartof | 9th workshop on parallel systems and algorithms – workshop of the GI/ITG special interest groups PARS and PARVA | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-124 | |
| dc.title | High Performance Multigrid on Current Large Scale Parallel Computers | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 45 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 37 | |
| gi.conference.date | February 26th, 2008 | |
| gi.conference.location | Dresden | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1