一句话：提出 DSL 与编译器 Scion，将 BVH 数据布局与遍历算法解耦，支持体系结构无关的布局优化空间探索。
包围体层次结构（BVH）广泛用于图形学、科学计算与数据分析，其性能高度依赖数据布局，影响缓存、内存带宽与向量化；但现有系统将布局与遍历逻辑深度耦合，开发者难以独立优化二者，形成性能与可移植性的虚假对立。本文提出 Scion——描述 BVH 数据布局的领域特定语言与编译器，使布局规格独立于树遍历算法，能表达高性能计算中的多种布局优化且保持体系结构无关。通过系统化设计空间探索，作者实证表明 Pareto 最优布局随算法、体系结构与负载特征变化，并识别出一种新的光线追踪布局，在多样架构与场景下达到 Pareto 最优。
Bounding volume hierarchies are ubiquitous acceleration structures in graphics, scientific computing, and data analytics. Their performance depends critically on data layout choices that affect cache utilization, memory bandwidth, and vectorization---increasingly dominant factors in modern computing. Yet, in most programming systems, these layout choices are hopelessly entangled with the traversal logic. This entanglement prevents developers from independently optimizing data layouts and algorithms across different contexts, perpetuating a false dichotomy between performance and portability. We introduce Scion, a domain-specific language and compiler for specifying the data layouts of bounding volume hierarchies independent of tree traversal algorithms. We show that Scion can express a broad spectrum of layout optimizations used in high-performance computing while remaining architecture-agnostic. We demonstrate empirically that Pareto-optimal layouts (along performance and memory footprint axes) vary across algorithms, architectures, and workload characteristics. Through systematic design exploration, we also identify a novel ray tracing layout that combines optimization techniques from prior work, achieving Pareto-optimality across diverse architectures and scenes.
DOI 原文 · arXiv · PDF（开放获取） · DBLP
@article{GyurgyikRK26,
title = {Decoupling Data Layouts from Bounding Volume Hierarchies},
author = {Christophe Gyurgyik and Alexander J Root and Fredrik Kjolstad},
journal = {Proceedings of the ACM on Programming Languages},
volume = {10},
number = {PLDI},
year = {2026},
doi = {10.1145/3808253}
}