Architecture-Adaptable Finite Element Modelling A Case Study using an Ocean Circulation Sim.pdfVIP

下载本文档

2
0
约4.22万字
约 22页
2017-04-13 发布于江苏
举报
版权申诉

Architecture-Adaptable Finite Element Modelling A Case Study using an Ocean Circulation Sim.pdf

1、本文档共22页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Architecture-Adaptable Finite Element Modelling A Case Study using an Ocean Circulation Sim

Architecture-Adaptable Finite ElementModelling: A Case Study using an OceanCirculation SimulationSanthosh Kumarany, Robert N. Millerz, and Michael J. QuinnyyDepartment of Computer ScienceOregon State University, Corvallis, OR 97331.zCollege of Oceanic and Atmospheric SciencesOregon State University, Corvallis, OR 97331.AbstractWe describe an architecture-adaptable methodology for the parallel implemen-tation of nite element numerical models of physical systems. We use a model oftime-dependent ocean currents as our working example. The heart of the com-putation is the solution of a banded linear system, and we describe an algorithmbased on the domain decomposition method to solve the banded system. The algo-rithm is represented in a divide-and-conquer framework. The well-dened algebraicstructure of this framework makes it relatively easy to predict the performance ofthe algorithm with high accuracy. Performance prediction makes possible architec-ture adaptability. In the case of the domain decomposition method described inthis paper, performance prediction enables us to make decisions about granularityand the number of processors to use for individual steps of the algorithm. Thedivide-and-conquer framework facilitates easy implementation of various algorith-mic options. The process is straightforward and amenable to automation. Wedemonstrate the validity of this approach using two radically dierent target ma-chines: a workstation network and a supercomputer. Our results show very goodspeedup on both platforms.1 IntroductionOne of the challenges in parallel computing research is to develop ecientparallel algorithms to solve problems which are known to have fast sequen-tial algorithms. An example of such a problem is the numerical solutionof partial dierential equations (PDEs) using the nite element method.The crucial part of this method is the solution of a banded linear system.Developing cost-optimal parallel algorithms to solve such systems is pivotalto ecien