首页 | 本学科首页   官方微博 | 高级检索  
     


Performance of parallel computations with dynamic processor allocation
Authors:Saeed Iqbal  Graham F. Carey
Affiliation:(1) Computational Fluid Dynamics Laboratory, The University of Texas at Austin, Institute for Computational Engineering and Sciences (ICES), 1 University Station C0600, Austin, TX 78712, USA
Abstract:
In parallel adaptive mesh refinement (AMR) computations the problem size can vary significantly during a simulation. The goal here is to explore the performance implications of dynamically varying the number of processors proportional to the problem size during simulation. An emulator has been developed to assess the effects of this approach on parallel communication, parallel runtime and resource consumption. The computation and communication models used in the emulator are described in detail. Results using the emulator with different AMR strategies are described for a test case. Results show for the test case, varying the number of processors, on average, reduces the total parallel communications overhead from 16 to 19% and improves parallel runtime time from 4 to 8%. These results also show that on average resource utilization improves more than 37%.
Keywords:Adaptive mesh refinement (AMR)  Resource utilization  Parallel performance  Dynamic processor allocation  Modelling parallel computations
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号