首页> 外文期刊>Engineering Computations >Comparison between O(n~2) and O(n) neighbor search algorithm and its influence on superlinear speedup in parallel discrete element method (DEM) for complex-shaped particles
【24h】

Comparison between O(n~2) and O(n) neighbor search algorithm and its influence on superlinear speedup in parallel discrete element method (DEM) for complex-shaped particles

机译:O(n〜2)与O(n)邻居搜索算法的比较及其对复杂形状粒子的并行离散元方法(DEM)中超线性加速的影响

获取原文
获取原文并翻译 | 示例
           

摘要

Purpose This paper aims to present performance comparison between O(n(2)) and O(n) neighbor search algorithms, studies their effects for different particle shape complexity and computational granularity (CG) and investigates the influence on superlinear speedup of 3D discrete element method (DEM) for complex-shaped particles. In particular, it aims to answer the question: O(n(2)) or O(n) neighbor search algorithm, which performs better in parallel 3D DEM computational practice?
机译:目的本文旨在比较O(n(2))和O(n)邻居搜索算法的性能,研究它们对不同粒子形状复杂度和计算粒度(CG)的影响,并研究其对3D离散元素超线性加速的影响方法(DEM)用于复杂形状的粒子。特别是,它旨在回答以下问题:O(n(2))或O(n)邻居搜索算法,该算法在并行3D DEM计算实践中表现更好?

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号