Files in this item

FilesDescriptionFormat

application/pdf

application/pdfMADHUKAR-THESIS-2016.pdf (658kB)
(no description provided)PDF

Description

Title:Asynchronous parallel solver for hyperbolic problems via the Spacetime Discontinuous Galerkin method
Author(s):Madhukar, Amit
Advisor(s):Haber, Robert B
Department / Program:Mechanical Sci & Engineering
Discipline:Mechanical Engineering
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):Spacetime Discontinuous Galerkin Finite Element Method
Parallel
Thread Pool
Asynchronous
Unstructured Meshing
Abstract:This thesis presents a parallel Space Time Discontinuous Galerkin (SDG) finite element method which makes use of the method's unstructured mesh generation and localized solution technique to achieve a high level of parallel scalability. Our SDG method is different from most traditional adaptive finite element methods in that the solution process generates fully unstructured spacetime grids that satisfy a special causality constraint ensuring that computations can occur locally on small cluster of spacetime elements. The resulting asynchronous solution scheme offers several desirable features: element-wise conservation of solution quantities, strong stability properties without the need for explicit stabilization, local mesh adaptivity operations and linear complexity in the number of spacetime elements. In this thesis we propose an algorithm that effectively parallelizes the Tent Pitcher algorithm developed by [1] using the POSIX Thread (or Pthread) parallel execution model. Multiple software threads can simultaneously and asynchronously perform patch computations by advancing vertices in time. By enforcing the causality constraint on the time step, we can guarantee that each thread only performs calculations using data computed previously. Additionally, improvements to the adaptivity scheme allow for local mesh refinement and coarsening while maintaining globally conforming triangulation. Numerical tests show that our algorithm achieves high parallel scalability using shared-memory parallelization.
Issue Date:2016-12-08
Type:Thesis
URI:http://hdl.handle.net/2142/95421
Rights Information:Copyright 2016 Amit Madhukar
Date Available in IDEALS:2017-03-01
Date Deposited:2016-12


This item appears in the following Collection(s)

Item Statistics