{"id":{"repo_id":"ubc","oai_identifier":"oai:circle.library.ubc.ca:2429/51007"},"canonical_url":"https://search.ndltd.org/etd/ubc/oai:circle.library.ubc.ca:2429/51007","repository":{"repo_id":"ubc","name":"University of British Columbia","base_url":"http://circle.library.ubc.ca/oai/request"},"display":{"title":"Thread-parallel mesh generation and improvement using face-edge swapping and vertex insertion","abstract":"The purpose of this thesis is three-fold. First, we devise a memory model for unstructured mesh data for efficient use of memory on parallel shared memory architectures with the purpose of lowering the synchronization overhead between threads and also excluding the probability of occurring race conditions. Second, we present a new thread-parallel edge and face swapping algorithm for two and three dimensional meshes using OpenMP for shared memory architectures. We show how removing the conflicts from the reconfiguration procedure by applying a vertex locking strategy can result in a near linear speed-up with parallel efficiency of close to one on two threads and 70% with sixteen threads on shared-memory processors. Finally, we derive a parallel mesh generation and refinement module for shared memory architectures based on pre-existing serial modules — GRUMMP — by implementing Chernikov and Chrisochoides’ parallel insertion algorithm along with the two above tools. Experiments show a worst case parallel efficiency of 60% for parallel refinement with 16 threads.","abstract_html":"The purpose of this thesis is three-fold. First, we devise a memory model for unstructured mesh data for efficient use of memory on parallel shared memory architectures with the purpose of lowering the synchronization overhead between threads and also excluding the probability of occurring race conditions. Second, we present a new thread-parallel edge and face swapping algorithm for two and three dimensional meshes using OpenMP for shared memory architectures. We show how removing the conflicts from the reconfiguration procedure by applying a vertex locking strategy can result in a near linear speed-up with parallel efficiency of close to one on two threads and 70% with sixteen threads on shared-memory processors. Finally, we derive a parallel mesh generation and refinement module for shared memory architectures based on pre-existing serial modules — GRUMMP — by implementing Chernikov and Chrisochoides’ parallel insertion algorithm along with the two above tools. Experiments show a worst case parallel efficiency of 60% for parallel refinement with 16 threads.","abstract_has_math":false,"creators":["Zangeneh, Reza"],"institution":"University of British Columbia","degree_name":"Master of Applied Science - MASc","degree_level":"master's","degree_discipline":"Mechanical Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-11-19T14:58:48Z","subjects":[],"languages":["eng"],"rights":["Attribution-NonCommercial-NoDerivs 2.5 Canada"],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/2.5/ca/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2429/51007","outbound_label":"Handle","outbound_source":"dc:identifier","record_url":"http://hdl.handle.net/2429/51007","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier","download_url":"http://circle.library.ubc.ca/bitstream/2429/51007/1/ubc_2015_february_zangeneh_reza.pdf","download_label":"Download PDF","download_source":"dc:identifier","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"http://circle.library.ubc.ca/oai/request?verb=GetRecord&metadataPrefix=etdms&identifier=oai%3Acircle.library.ubc.ca%3A2429%2F51007","prefix":"etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Zangeneh, Reza"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014"]},{"key":"dc:publisher","label":"Institution","values":["University of British Columbia"]},{"key":"dc:type","label":"Dc Type","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mechanical Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["master's"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Applied Science - MASc"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of British Columbia"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["http://creativecommons.org/licenses/by-nc-nd/2.5/ca/","Attribution-NonCommercial-NoDerivs 2.5 Canada"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2429/51007","http://circle.library.ubc.ca/bitstream/2429/51007/1/ubc_2015_february_zangeneh_reza.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The purpose of this thesis is three-fold. First, we devise a memory model for unstructured mesh data for efficient use of memory on parallel shared memory architectures with the purpose of lowering the synchronization overhead between threads and also excluding the probability of occurring race conditions. Second, we present a new thread-parallel edge and face swapping algorithm for two and three dimensional meshes using OpenMP for shared memory architectures. We show how removing the conflicts from the reconfiguration procedure by applying a vertex locking strategy can result in a near linear speed-up with parallel efficiency of close to one on two threads and 70% with sixteen threads on shared-memory processors. Finally, we derive a parallel mesh generation and refinement module for shared memory architectures based on pre-existing serial modules — GRUMMP — by implementing Chernikov and Chrisochoides’ parallel insertion algorithm along with the two above tools. Experiments show a worst case parallel efficiency of 60% for parallel refinement with 16 threads."]},{"key":"dc:format","label":"Dc Format","values":["2097485","application/pdf"]},{"key":"dc:title","label":"Title","values":["Thread-parallel mesh generation and improvement using face-edge swapping and vertex insertion"]}]}],"canonical_facts":{"dc:creator":["Zangeneh, Reza"],"dc:date":["2014"],"dc:description":["The purpose of this thesis is three-fold. First, we devise a memory model for unstructured mesh data for efficient use of memory on parallel shared memory architectures with the purpose of lowering the synchronization overhead between threads and also excluding the probability of occurring race conditions. Second, we present a new thread-parallel edge and face swapping algorithm for two and three dimensional meshes using OpenMP for shared memory architectures. We show how removing the conflicts from the reconfiguration procedure by applying a vertex locking strategy can result in a near linear speed-up with parallel efficiency of close to one on two threads and 70% with sixteen threads on shared-memory processors. Finally, we derive a parallel mesh generation and refinement module for shared memory architectures based on pre-existing serial modules — GRUMMP — by implementing Chernikov and Chrisochoides’ parallel insertion algorithm along with the two above tools. Experiments show a worst case parallel efficiency of 60% for parallel refinement with 16 threads."],"dc:format":["2097485","application/pdf"],"dc:identifier":["http://hdl.handle.net/2429/51007","http://circle.library.ubc.ca/bitstream/2429/51007/1/ubc_2015_february_zangeneh_reza.pdf"],"dc:language":["eng"],"dc:publisher":["University of British Columbia"],"dc:rights":["http://creativecommons.org/licenses/by-nc-nd/2.5/ca/","Attribution-NonCommercial-NoDerivs 2.5 Canada"],"dc:title":["Thread-parallel mesh generation and improvement using face-edge swapping and vertex insertion"],"dc:type":["Text"],"thesis:degree_discipline":["Mechanical Engineering"],"thesis:degree_level":["master's"],"thesis:degree_name":["Master of Applied Science - MASc"],"thesis:institution_name":["University of British Columbia"]},"updated_at":"2026-11-19T14:58:48Z"}