基于边权约束法实现接触问题多约束图剖分

为提高接触问题并行计算的效率,分析内力计算和接触计算过程的并行性,提出基于边权约束法构造接触多约束图的方法,对比和分析多约束图剖分算法和双重区域剖分算法的负载平衡和通信性能.数值实验表明,在典型二维模型中多约束图剖分算法的负载平衡性能略低于双重区域剖分算法,但仍可将负载不平衡度控制在较好的范围内,简化并行计算的通信过程,减少总通信量并降低动态通信量比例.

Edge-weight constraint method for multi-constraint graph decomposition of contact problems

To improve the parallel computing efficiency of contact problems,the parallelism of internal force calculation and contact calculation is analyzed,the method of constructing multi-constraint graph based on edge-weight constraint method is proposed,and the performance of load balancing and communication is compared and analyzed for multi-constraint graph decomposition algorithm and dual domain decomposition algorithm.The numerical test of a typical 2D model indicates that the load balancing performance of multi-constraint graph decomposition algorithm is slightly lower than that of dual domain decomposition algorithm,but multi-constraint graph decomposition algorithm can better control load imbalance in the range and simplify the communication process in parallel computing.So the total traffic and the proportion of dynamic traffic can be decreased.