Low-Depth Spatial Tree Algorithms
Yves Baumann, Tal Ben-Nun, Maciej Besta, Lukas Gianinazzi, Torsten, Hoefler, and Piotr Luczynski

TL;DR
This paper introduces a framework for spatial tree algorithms optimized for high locality in spatial computer architectures, achieving significant energy efficiency and low depth for fundamental graph operations.
Contribution
It proposes a novel spatial tree layout that enhances locality and energy efficiency, along with new algorithms for treefix sum and lowest common ancestor in the spatial computer model.
Findings
Achieves polynomial energy improvement over PRAM-based methods.
Algorithms exhibit near-linear energy and poly-logarithmic depth.
Advances the spatial layout of irregular and sparse computations.
Abstract
Contemporary accelerator designs exhibit a high degree of spatial localization, wherein two-dimensional physical distance determines communication costs between processing elements. This situation presents considerable algorithmic challenges, particularly when managing sparse data, a pivotal component in progressing data science. The spatial computer model quantifies communication locality by weighting processor communication costs by distance, introducing a term named energy. Moreover, it integrates depth, a widely-utilized metric, to promote high parallelism. We propose and analyze a framework for efficient spatial tree algorithms within the spatial computer model. Our primary method constructs a spatial tree layout that optimizes the locality of the neighbors in the compute grid. This approach thereby enables locality-optimized messaging within the tree. Our layout achieves a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Data Management and Algorithms · Constraint Satisfaction and Optimization
