JZ-Tree introduces a flattened Morton plane-based tree hierarchy enabling collaborative dual-tree walks that deliver more than 10x faster exact k-NN search and FoF clustering on GPUs for N greater than 10 million particles, with multi-GPU scaling.
Title resolution pending
2 Pith papers cite this work, alongside 33 external citations. Polarity classification is still indexing.
2
Pith papers citing it
33
external citations · OpenAlex
fields
cs.DC 2verdicts
UNVERDICTED 2representative citing papers
A novel MPI-based construction method for spiking neural networks on multi-GPU clusters is introduced, with scaling demonstrated on two cortical models using point-to-point and collective communication.
citing papers explorer
-
JZ-Tree: GPU friendly neighbour search and friends-of-friends with dual tree walks in JAX plus CUDA
JZ-Tree introduces a flattened Morton plane-based tree hierarchy enabling collaborative dual-tree walks that deliver more than 10x faster exact k-NN search and FoF clustering on GPUs for N greater than 10 million particles, with multi-GPU scaling.
-
Scalable Construction of Spiking Neural Networks using up to thousands of GPUs
A novel MPI-based construction method for spiking neural networks on multi-GPU clusters is introduced, with scaling demonstrated on two cortical models using point-to-point and collective communication.