A Hybrid Parallel Algorithm for Transforming Finite Element Functions from Adaptive to Cartesian Grids

• Published in: High Performance Computing Systems and Applications pp. 48 - 61
• Main Authors: Fortmeier, Oliver, Bücker, H. Martin
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010
• Series: Lecture Notes in Computer Science
• Subjects: Cartesian Grid; Hierarchical Decomposition; Parallel Algorithm; Parallelization Strategy; Serial Algorithm
• ISBN: 3642126588; 9783642126581
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-12659-8_4

High-performance computing is often used in various fields of computational science and engineering where the availability of a large memory is crucial to represent given problems. For problems arising from the discretization of partial differential equations, adaptivity is an alternative approach to reduce the storage requirements. We present an illustrating example demonstrating the need for an algorithm change when a serial hierarchical data structure is parallelized. More precisely, we investigate this issue taking as example an algorithm to transform finite element functions defined on an adaptive grid into functions on a Cartesian grid. By combining distributed- and shared-memory parallelization, the resulting hybrid parallel algorithm involves two levels of parallelism. The performance of the parallel algorithm is shown to be highly problem dependent. There are certain problem instances where the speedup is satisfactory while there is a dramatic performance reduction for other problem instances. The numerical experiments are given for transformations resulting from three-dimensional computational fluid dynamic problems. The problem instances are given by up to 750 000 tetrahedra representing about 3 millions of unknown variables. The experiments are carried out on a Xeon-based cluster using up to 64 processors.