skip to main content


Title: Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Here, we propose a dynamically load-balanced algorithm for parallel particle tracing, which periodically attempts to evenly redistribute particles across processes based on k-d tree decomposition. Each process is assigned with (1) a statically partitioned, axis-aligned data block that partially overlaps with neighboring blocks in other processes and (2) a dynamically determined k-d tree leaf node that bounds the active particles for computation; the bounds of the k-d tree nodes are constrained by the geometries of data blocks. Given a certain degree of overlap between blocks, our method can balance the number of particles as much as possible. Compared with other load-balancing algorithms for parallel particle tracing, the proposed method does not require any preanalysis, does not use any heuristics based on flow features, does not make any assumptions about seed distribution, does not move any data blocks during the run, and does not need any master process for work redistribution. Based on a comprehensive performance study up to 8K processes on a Blue Gene/Q system, the proposed algorithm outperforms baseline approaches in both load balance and scalability on various flow visualization and analysis problems.
 [1] ;  [2] ;  [1] ;  [1] ;  [2]
  1. Peking Univ., Beijing (China)
  2. Argonne National Lab. (ANL), Lemont, IL (United States)
Publication Date:
Grant/Contract Number:
Accepted Manuscript
Journal Name:
IEEE Transactions on Visualization and Computer Graphics
Additional Journal Information:
Journal Volume: 24; Journal Issue: 1; Journal ID: ISSN 1077-2626
Research Org:
Argonne National Lab. (ANL), Argonne, IL (United States)
Sponsoring Org:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21); National Natural Science Foundation of China (NNSFC); National Key Basic Research Program of China
Country of Publication:
United States
97 MATHEMATICS AND COMPUTING; parallel particle tracing; dynamic load balancing; k-d trees; performance analysis
OSTI Identifier: