No Cover Image

E-Thesis 368 views 120 downloads

Unstructured parallel grid generation. / Rajab Said

Swansea University Author: Rajab Said

Abstract

The ultimate goal of this study is to develop a 'tool' by which large-scale unstructured grids for realistic engineering problems can be generated efficiently on any parallel computer platform. The adopted strategy is based upon a geometrical partitioning concept, where the computational d...

Full description

Published: 2003
Institution: Swansea University
Degree level: Doctoral
Degree name: Ph.D
URI: https://cronfa.swan.ac.uk/Record/cronfa42637
first_indexed 2018-08-02T18:55:11Z
last_indexed 2018-08-03T10:10:41Z
id cronfa42637
recordtype RisThesis
fullrecord <?xml version="1.0"?><rfc1807><datestamp>2018-08-02T16:24:29.9306015</datestamp><bib-version>v2</bib-version><id>42637</id><entry>2018-08-02</entry><title>Unstructured parallel grid generation.</title><swanseaauthors><author><sid>60ac6ca14d77fc997635ec447b5bc0b6</sid><ORCID>NULL</ORCID><firstname>Rajab</firstname><surname>Said</surname><name>Rajab Said</name><active>true</active><ethesisStudent>true</ethesisStudent></author></swanseaauthors><date>2018-08-02</date><abstract>The ultimate goal of this study is to develop a 'tool' by which large-scale unstructured grids for realistic engineering problems can be generated efficiently on any parallel computer platform. The adopted strategy is based upon a geometrical partitioning concept, where the computational domain is sub-divided into a number of sub-domains which are then gridded independently in parallel. This study focuses on three-dimensional applications only, and it implements a Delaunay triangulation based generator to generate the sub-domain grids. Two different approaches have been investigated, where the variations between them are limited to (i) the domain decomposition and (ii) the inter-domain boundary gridding algorithms only. In order to carry out the domain decomposition task, the first approach requires an initial tetrahedral grid to be constructed, whilst the second approach operates directly on the boundary triangular grid. Hence, this thesis will refer to the first approach as 'indirect decomposition method' and to the second as 'direct decomposition method'. Work presented in this thesis also concerns the development of a framework in which all different sub-algorithms are integrated in combination with a specially designed parallel processing technique, termed as Dynamic Parallel Processing (DPP). The framework adopts the Message Passing Library (MPL) programming model and implements a Single Program Multiple Data (SPMD) structure with a Manager/Workers mechanism. The DPP provides great flexibility and efficiency in exploiting the available computing resources. The framework has proved to be a very effective tool for generating large-scale grids. Grids of realistic engineering problems and to the order of 115 million elements, generated using one processor on an SGI Challenge machine with 512 MBytes of shared memory, will be presented.</abstract><type>E-Thesis</type><journal/><journalNumber></journalNumber><paginationStart/><paginationEnd/><publisher/><placeOfPublication/><isbnPrint/><issnPrint/><issnElectronic/><keywords>Computer engineering.</keywords><publishedDay>31</publishedDay><publishedMonth>12</publishedMonth><publishedYear>2003</publishedYear><publishedDate>2003-12-31</publishedDate><doi/><url/><notes/><college>COLLEGE NANME</college><department>Engineering</department><CollegeCode>COLLEGE CODE</CollegeCode><institution>Swansea University</institution><degreelevel>Doctoral</degreelevel><degreename>Ph.D</degreename><apcterm/><lastEdited>2018-08-02T16:24:29.9306015</lastEdited><Created>2018-08-02T16:24:29.9306015</Created><path><level id="1">Faculty of Science and Engineering</level><level id="2">School of Engineering and Applied Sciences - Uncategorised</level></path><authors><author><firstname>Rajab</firstname><surname>Said</surname><orcid>NULL</orcid><order>1</order></author></authors><documents><document><filename>0042637-02082018162510.pdf</filename><originalFilename>10805413.pdf</originalFilename><uploaded>2018-08-02T16:25:10.1470000</uploaded><type>Output</type><contentLength>17181843</contentLength><contentType>application/pdf</contentType><version>E-Thesis</version><cronfaStatus>true</cronfaStatus><embargoDate>2018-08-02T16:25:10.1470000</embargoDate><copyrightCorrect>false</copyrightCorrect></document></documents><OutputDurs/></rfc1807>
spelling 2018-08-02T16:24:29.9306015 v2 42637 2018-08-02 Unstructured parallel grid generation. 60ac6ca14d77fc997635ec447b5bc0b6 NULL Rajab Said Rajab Said true true 2018-08-02 The ultimate goal of this study is to develop a 'tool' by which large-scale unstructured grids for realistic engineering problems can be generated efficiently on any parallel computer platform. The adopted strategy is based upon a geometrical partitioning concept, where the computational domain is sub-divided into a number of sub-domains which are then gridded independently in parallel. This study focuses on three-dimensional applications only, and it implements a Delaunay triangulation based generator to generate the sub-domain grids. Two different approaches have been investigated, where the variations between them are limited to (i) the domain decomposition and (ii) the inter-domain boundary gridding algorithms only. In order to carry out the domain decomposition task, the first approach requires an initial tetrahedral grid to be constructed, whilst the second approach operates directly on the boundary triangular grid. Hence, this thesis will refer to the first approach as 'indirect decomposition method' and to the second as 'direct decomposition method'. Work presented in this thesis also concerns the development of a framework in which all different sub-algorithms are integrated in combination with a specially designed parallel processing technique, termed as Dynamic Parallel Processing (DPP). The framework adopts the Message Passing Library (MPL) programming model and implements a Single Program Multiple Data (SPMD) structure with a Manager/Workers mechanism. The DPP provides great flexibility and efficiency in exploiting the available computing resources. The framework has proved to be a very effective tool for generating large-scale grids. Grids of realistic engineering problems and to the order of 115 million elements, generated using one processor on an SGI Challenge machine with 512 MBytes of shared memory, will be presented. E-Thesis Computer engineering. 31 12 2003 2003-12-31 COLLEGE NANME Engineering COLLEGE CODE Swansea University Doctoral Ph.D 2018-08-02T16:24:29.9306015 2018-08-02T16:24:29.9306015 Faculty of Science and Engineering School of Engineering and Applied Sciences - Uncategorised Rajab Said NULL 1 0042637-02082018162510.pdf 10805413.pdf 2018-08-02T16:25:10.1470000 Output 17181843 application/pdf E-Thesis true 2018-08-02T16:25:10.1470000 false
title Unstructured parallel grid generation.
spellingShingle Unstructured parallel grid generation.
Rajab Said
title_short Unstructured parallel grid generation.
title_full Unstructured parallel grid generation.
title_fullStr Unstructured parallel grid generation.
title_full_unstemmed Unstructured parallel grid generation.
title_sort Unstructured parallel grid generation.
author_id_str_mv 60ac6ca14d77fc997635ec447b5bc0b6
author_id_fullname_str_mv 60ac6ca14d77fc997635ec447b5bc0b6_***_Rajab Said
author Rajab Said
author2 Rajab Said
format E-Thesis
publishDate 2003
institution Swansea University
college_str Faculty of Science and Engineering
hierarchytype
hierarchy_top_id facultyofscienceandengineering
hierarchy_top_title Faculty of Science and Engineering
hierarchy_parent_id facultyofscienceandengineering
hierarchy_parent_title Faculty of Science and Engineering
department_str School of Engineering and Applied Sciences - Uncategorised{{{_:::_}}}Faculty of Science and Engineering{{{_:::_}}}School of Engineering and Applied Sciences - Uncategorised
document_store_str 1
active_str 0
description The ultimate goal of this study is to develop a 'tool' by which large-scale unstructured grids for realistic engineering problems can be generated efficiently on any parallel computer platform. The adopted strategy is based upon a geometrical partitioning concept, where the computational domain is sub-divided into a number of sub-domains which are then gridded independently in parallel. This study focuses on three-dimensional applications only, and it implements a Delaunay triangulation based generator to generate the sub-domain grids. Two different approaches have been investigated, where the variations between them are limited to (i) the domain decomposition and (ii) the inter-domain boundary gridding algorithms only. In order to carry out the domain decomposition task, the first approach requires an initial tetrahedral grid to be constructed, whilst the second approach operates directly on the boundary triangular grid. Hence, this thesis will refer to the first approach as 'indirect decomposition method' and to the second as 'direct decomposition method'. Work presented in this thesis also concerns the development of a framework in which all different sub-algorithms are integrated in combination with a specially designed parallel processing technique, termed as Dynamic Parallel Processing (DPP). The framework adopts the Message Passing Library (MPL) programming model and implements a Single Program Multiple Data (SPMD) structure with a Manager/Workers mechanism. The DPP provides great flexibility and efficiency in exploiting the available computing resources. The framework has proved to be a very effective tool for generating large-scale grids. Grids of realistic engineering problems and to the order of 115 million elements, generated using one processor on an SGI Challenge machine with 512 MBytes of shared memory, will be presented.
published_date 2003-12-31T07:16:43Z
_version_ 1826371722306125824
score 11.055436

Similar Items