Gradl, TobiasRüde, UlrichNagel, Wolfgang E.Hoffmann, RolfKoch, Andreas2019-05-062019-05-062008978-3-88579-218-5https://dl.gi.de/handle/20.500.12116/22274Making 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.enText/Conference Paper1617-5468