arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1005.3158cs.DC
收藏

显式有限元程序缓存效率的提高及其在并行铸造凝固模拟中的应用

Improvement Cache Efficiency of Explicit Finite Element Procedure and its Application to Parallel Casting Solidification Simulation

Ruhollah Tavakoli

摘要:

提出了一种提高串行和并行显式有限程序缓存效率的简单方法,并将其应用于三维复杂几何形状的铸件凝固模拟。该方法基于将全局数据划分为更小的块,并且在每个时间步独立于其他块来处理每个块。提出了一种新的非重叠单元基分解域的并行有限元算法,实现了该方法的串行和并行版本。网格重排的效率的影响进行了研究。提出了一种简单的高质量解耦网格分解算法。我们的结果表明,10- 20%的性能提高网格重新排序和1.2-2.2的加速比与应用程序的高速缓存有效的算法(串行和并行版本)。此外,所提出的并行求解器(没有高速缓存效率的功能)在传统的以太网联网的Linux集群上显示出接近线性的加速比。

英文摘要:

A simple method for improving cache efficiency of serial and parallel explicit finite procedure with application to casting solidification simulation over three-dimensional complex geometries is presented. The method is based on division of the global data to smaller blocks and treating each block independently from others at each time step. A novel parallel finite element algorithm for non-overlapped element-base decomposed domain is presented for implementation of serial and parallel version of the presented method. Effect of mesh reordering on the efficiency is also investigated. A simple algorithm is presented for high quality decomposition of decoupled global mesh. Our result shows 10-20 \% performance improvement by mesh reordering and 1.2-2.2 speedup with application of the presented cache efficient algorithm (for serial and parallel versions). Also the presented parallel solver (without cache-efficient feature) shows nearly linear speedup on the traditional Ethernet networked Linux cluster.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑