CHINESE JOURNAL OF COMPUTATIONAL PHYSICS ›› 2017, Vol. 34 ›› Issue (5): 563-573.

Special Issue: 超强激光等离子体相互作用的数值模拟

Previous Articles     Next Articles

A Fast Box Set Subtraction Algorithm for Parallel Structured Adaptive Mesh Refinement Applications

LIU Xu, XU Xiaowen, ZHANG Aiqing   

  1. Institute of Applied Physics and Computational Mathematics, Beijing 100094, China
  • Received:2016-07-11 Revised:2016-12-27 Online:2017-09-25 Published:2017-09-25

Abstract: Box set subtraction is widely used in SAMR to compute data dependency and nested restriction. Traditional box set subtraction algorithms suffer from high time complexity, which often dominates execution time for large scale SAMR simulations. In this paper, a divide and conquer box set subtraction algorithm with linear time complexity was proposed, and enhanced by domain decomposition parallelization. Experiment results on regular box set and irregular box set of SAMR application verify linear time complexity property. And for large scale problems, our algorithm shows great improvement on computing time.

Key words: parallel computing, structured adaptive mesh refinement, box set subtraction algorithm, linear time complexity

CLC Number: