东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (11): 1602-1605.DOI: -

• 论著 • 上一篇    下一篇

基于OpenMP的湍流场中颗粒碰撞聚合的并行数值模拟

雷洪;赫冀成;   

  1. 东北大学材料电磁过程研究教育部重点实验室;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-11-15 发布日期:2013-06-22
  • 通讯作者: Lei, H.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(2009AA03Z530);;

OpenMP-based parallel numerical simulation of collision and aggregation among particles in turbulent field

Lei, Hong (1); He, Ji-Cheng (1)   

  1. (1) Key Laboratory of Electromagnetic Processing of Materials, Ministry of Education, Northeastern University, Shenyang 110004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-11-15 Published:2013-06-22
  • Contact: Lei, H.
  • About author:-
  • Supported by:
    -

摘要: 为了快速求解10000个粒子的湍流碰撞聚合问题,采用OpenMP对Smoluchowski方程的FORTRAN求解程序进行了并行处理.数值结果表明:在不改变串行程序结构的情况下,仅对循环体部分进行并行处理,并行效率可高达80%,且串行程序与并行程序的计算结果完全吻合.对于大计算量循环体的并行计算,采用全部处理器进行并行计算时耗时最小.但是对于小计算量循环体的并行计算,采用全部处理器进行并行计算时耗时不一定最小.

关键词: Smoluchowski方程, 并行计算, OpenMP, 并行加速比, 并行效率

Abstract: To speed up the simulation of the turbulence-collision-aggregation among 10, 000 particles, OpenMP is introduced to parallelize the FORTRAN source codes for Smoluchowski equation. Numerical results showed that if the serial program's structure remains unchanged and only the loops are parallelized, the parallel performance will be up to 80%, and the computational results of both parallel and serial programs coincide. For the heavy-load computation of loops, the computing time required is minimum if all CPUs are used, but for the light-load one, it is unsure whether the computing time required is minimum even if all CPUs are used.

中图分类号: