Show simple item record

dc.rights.licenseUsers may download and share copies with attribution in accordance with a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. No commercial use or derivatives are permitted without the explicit approval of the author.
dc.contributorShephard, M. S. (Mark S.)
dc.contributorSahni, Onkar
dc.contributorCarothers, Christopher D.
dc.contributorAnshelevich, Elliot
dc.contributor.authorIbanez, Daniel Alejandro
dc.date.accessioned2021-11-03T08:42:18Z
dc.date.available2021-11-03T08:42:18Z
dc.date.created2017-01-13T09:28:10Z
dc.date.issued2016-12
dc.identifier.urihttps://hdl.handle.net/20.500.13015/1817
dc.descriptionDecember 2016
dc.descriptionSchool of Science
dc.description.abstractMesh adaptation is a technique which dynamically modifies the mesh being used to approximately solve a Partial Differential Equation (PDE) in order to improve aspects of the approximate solution including the computer time and memory used to compute it as well as its level of accuracy. Even with the use of mesh adaptation, computing ever more accurate PDE solutions requires significant computer time and memory, motivating the use of supercomputers, which are constructed as networks of cooperating computational hardware. Trends in the computer hardware industry at large are introducing heterogeneous designs for current leadership-class supercomputers, which is both an opportunity and a challenge for programs aiming to make use of these machines.
dc.description.abstractSeveral improvements to the design of mesh adaptation programs are presented, including solution transfer methods which preserve mass and momentum, methods for the maintenance of high-quality elements, scalable and deterministic methods for hybrid parallelization of mesh modification operations, and a combination of modification operators which reduce implementation complexity without sacrificing effectiveness.
dc.description.abstractThis thesis presents implementations of mesh adaptation which are designed with memory efficient cache-friendly data structures and algorithms which can effectively leverage both distributed memory parallelism and shared memory parallelism (including GPUs). The data structures used in these implementations are widely applicable to other tasks involving meshes, and the programming paradigms introduced are general enough to be of use in most programs targeting leadership-class supercomputers. The implementations presented are being used by several simulation codes in production, and are available as open-source tools so they may continue providing value to the scientific community.
dc.language.isoENG
dc.publisherRensselaer Polytechnic Institute, Troy, NY
dc.relation.ispartofRensselaer Theses and Dissertations Online Collection
dc.subjectComputer science
dc.titleConformal mesh adaptation on heterogeneous supercomputers
dc.typeElectronic thesis
dc.typeThesis
dc.digitool.pid177777
dc.digitool.pid177782
dc.digitool.pid177780
dc.rights.holderThis electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
dc.description.degreePhD
dc.relation.departmentDept. of Computer Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record