并行平面网格生成的通用框架

Ligang Chen, Yi Liang, Jianjun Chen, Yao Zheng
{"title":"并行平面网格生成的通用框架","authors":"Ligang Chen, Yi Liang, Jianjun Chen, Yao Zheng","doi":"10.1109/IMSCCS.2006.7","DOIUrl":null,"url":null,"abstract":"In this paper, we present a general framework for 2D parallel mesh generation. A prepartitioner for domain decomposition is integrated into the framework, which strives to make the resulting subdomains well-shaped and thus guarantees the high quality of resulting meshes. Moreover, the time-consuming prepartitioning stage is parallelized in two ways with various grained levels, and the finer grained one turns out preferable. The subdomain connections are stored as a subdomain graph (SDG), which helps prevent mapping disconnected subdomains into a single processor whenever static or dynamic load balancing strategies are adopted. Well partitioned meshes could be generated simultaneously with parallel mesh generation, and hence the cost of mesh repartitioning could be eliminated or reduced. The SDG construction is simplified and independent of domain decomposition by introducing the concept of the characteristic polygon set (CPS). Shared nodes between neighboring subdomains are duplicated, that ensures subdomain meshing be completed with little or without communications, and full code-reuse of serial meshing algorithms be achieved in this framework","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"281 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A General Framework for Parallel Planar Mesh Generation\",\"authors\":\"Ligang Chen, Yi Liang, Jianjun Chen, Yao Zheng\",\"doi\":\"10.1109/IMSCCS.2006.7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a general framework for 2D parallel mesh generation. A prepartitioner for domain decomposition is integrated into the framework, which strives to make the resulting subdomains well-shaped and thus guarantees the high quality of resulting meshes. Moreover, the time-consuming prepartitioning stage is parallelized in two ways with various grained levels, and the finer grained one turns out preferable. The subdomain connections are stored as a subdomain graph (SDG), which helps prevent mapping disconnected subdomains into a single processor whenever static or dynamic load balancing strategies are adopted. Well partitioned meshes could be generated simultaneously with parallel mesh generation, and hence the cost of mesh repartitioning could be eliminated or reduced. The SDG construction is simplified and independent of domain decomposition by introducing the concept of the characteristic polygon set (CPS). Shared nodes between neighboring subdomains are duplicated, that ensures subdomain meshing be completed with little or without communications, and full code-reuse of serial meshing algorithms be achieved in this framework\",\"PeriodicalId\":202629,\"journal\":{\"name\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"volume\":\"281 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMSCCS.2006.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSCCS.2006.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们提出了一个二维并行网格生成的一般框架。在框架中集成了域分解预处理器,力求得到形状良好的子域,从而保证得到的网格质量高。此外,耗时的预分区阶段以两种不同粒度级别的方式并行化,粒度更细的阶段更可取。子域连接存储为子域图(SDG),这有助于防止在采用静态或动态负载平衡策略时将断开连接的子域映射到单个处理器。通过并行网格生成,可以同时生成划分良好的网格,从而消除或减少网格重新划分的代价。通过引入特征多边形集(CPS)的概念,简化了SDG的构建,使其不依赖于区域分解。该框架实现了相邻子域间共享节点的复制,保证了子域网格划分无需通信或通信较少,实现了串行网格划分算法的完全代码重用
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A General Framework for Parallel Planar Mesh Generation
In this paper, we present a general framework for 2D parallel mesh generation. A prepartitioner for domain decomposition is integrated into the framework, which strives to make the resulting subdomains well-shaped and thus guarantees the high quality of resulting meshes. Moreover, the time-consuming prepartitioning stage is parallelized in two ways with various grained levels, and the finer grained one turns out preferable. The subdomain connections are stored as a subdomain graph (SDG), which helps prevent mapping disconnected subdomains into a single processor whenever static or dynamic load balancing strategies are adopted. Well partitioned meshes could be generated simultaneously with parallel mesh generation, and hence the cost of mesh repartitioning could be eliminated or reduced. The SDG construction is simplified and independent of domain decomposition by introducing the concept of the characteristic polygon set (CPS). Shared nodes between neighboring subdomains are duplicated, that ensures subdomain meshing be completed with little or without communications, and full code-reuse of serial meshing algorithms be achieved in this framework
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信