skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

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

Abstract

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.

Authors:
; ; ; ;
Publication Date:
Research Org.:
Argonne National Lab. (ANL), Argonne, IL (United States)
Sponsoring Org.:
USDOE Office of Science (SC)
OSTI Identifier:
1432548
DOE Contract Number:  
AC02-06CH11357
Resource Type:
Conference
Resource Relation:
Conference: 2017 IEEE Visual Analytics Science and Technology, IEEE Information Visualization, and IEEE Scientific Visualization, 10/01/17 - 10/06/17, Phoenix, AZ, US
Country of Publication:
United States
Language:
English

Citation Formats

Zhang, Jiang, Guo, Hanqi, Yuan, Xiaoru, Hong, Fan, and Peterka, Tom. Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing. United States: N. p., 2018. Web. doi:10.1109/tvcg.2017.2744059.
Zhang, Jiang, Guo, Hanqi, Yuan, Xiaoru, Hong, Fan, & Peterka, Tom. Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing. United States. doi:10.1109/tvcg.2017.2744059.
Zhang, Jiang, Guo, Hanqi, Yuan, Xiaoru, Hong, Fan, and Peterka, Tom. Mon . "Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing". United States. doi:10.1109/tvcg.2017.2744059.
@article{osti_1432548,
title = {Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing},
author = {Zhang, Jiang and Guo, Hanqi and Yuan, Xiaoru and Hong, Fan and Peterka, Tom},
abstractNote = {Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.},
doi = {10.1109/tvcg.2017.2744059},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2018},
month = {1}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: