Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

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

WANG Chenhui,SHEN Hao,XIAO Yonghao(Computer Application Institute,China Academy of Engineering Physics,Mianyang 621900,Sichuan,China)  
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.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved