This is a working implementation of the Barnes Hut problem, based on the reference implementation in the SPLASH2 benchmarks. Our implementations produces correct output both in sequential and parallel (i.e., more than 1 unit). There are no significant logical changes to improve the efficiency or performance.
Based on this implementation we can study various optimization strategies. One promising step is to apply our very well working dash::sort to load balance the bodies among our units based on space filling curves like the Hibert Order or Morton Z-Order.
This is a working implementation of the Barnes Hut problem, based on the reference implementation in the SPLASH2 benchmarks. Our implementations produces correct output both in sequential and parallel (i.e., more than 1 unit). There are no significant logical changes to improve the efficiency or performance.
Based on this implementation we can study various optimization strategies. One promising step is to apply our very well working
dash::sortto load balance the bodies among our units based on space filling curves like the Hibert Order or Morton Z-Order.