...
首页> 外文期刊>Concurrency and computation: practice and experience >Scalable large-scale fluid–structure interaction solvers in the Uintah framework via hybrid task-based parallelism algorithms
【24h】

Scalable large-scale fluid–structure interaction solvers in the Uintah framework via hybrid task-based parallelism algorithms

机译:通过基于任务的混合并行算法,在Uintah框架中可扩展的大规模流固耦合求解器

获取原文
获取原文并翻译 | 示例
           

摘要

Uintah is a software framework that provides an environment for solving fluid–structure interaction problemsrnon structured adaptive grids for large-scale science and engineering problems involving the solution of partialrndifferential equations. Uintah uses a combination of fluid flow solvers and particle-based methods for solids,rntogether with adaptive meshing and a novel asynchronous task-based approach with fully automated loadrnbalancing. When applying Uintah to fluid–structure interaction problems, the combination of adaptive meshingrnand the movement of structures through space present a formidable challenge in terms of achievingrnscalability on large-scale parallel computers. The Uintah approach to the growth of the number of corerncounts per socket together with the prospect of less memory per core is to adopt a model that uses MPI torncommunicate between nodes and a shared memory model on-node so as to achieve scalability on large-scalernsystems. For this approach to be successful, it is necessary to design data structures that large numbers ofrncores can simultaneously access without contention. This scalability challenge is addressed here for Uintah,rnby the development of new hybrid runtime and scheduling algorithms combined with novel lock-free datarnstructures, making it possible for Uintah to achieve excellent scalability for a challenging fluid–structurernproblem with mesh refinement on as many as 260K cores. Copyright © 2013 John Wiley & Sons, Ltd.
机译:Uintah是一个软件框架,为解决涉及偏微分方程的大规模科学和工程问题的非结构化自适应网格提供了解决流固耦合问题的环境。 Uintah结合使用了流体流动求解器和基于粒子的固体方法,并结合了自适应网格划分和基于新颖任务的基于异步任务的全自动负载平衡方法。当将Uintah应用到流固耦合问题时,自适应网格划分和结构在空间中的移动的结合对实现大型并行计算机的可伸缩性提出了巨大的挑战。使用Uintah方法来增加每个套接字的核心数以及每个核心具有更少内存的前景是采用一种模型,该模型使用MPI在节点之间进行撕裂式通信,并在节点上使用共享内存模型,从而在大型系统上实现可伸缩性。 。为了使该方法成功,必须设计可同时访问大量内核而不争用的数据结构。通过新的混合运行时和调度算法的开发以及新颖的无锁数据结构,Uintah可以解决此可扩展性挑战,这使得Uintah可以通过具有多达260K的网格细化来实现具有挑战性的流体结构问题的出色可扩展性核心。版权所有©2013 John Wiley&Sons,Ltd.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号