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

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 w...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 24(2018), 1 vom: 30. Jan., Seite 954-963
1. Verfasser: Zhang, Jiang (VerfasserIn)
Weitere Verfasser: Guo, Hanqi, Hong, Fan, Yuan, Xiaoru, Peterka, Tom
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2018
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, Non-P.H.S.