Axon:张量程序的综合超优化器
Axon: A Synthesizing Superoptimizer for Tensor Programs
AI总结:
提出Axon,一种通过程序综合自动生成目标指令并探索语义等价变体以选择最佳性能内核的张量程序超优化器,利用SMT保证变换语义正确性。
摘要:
为AI加速器编写高性能内核需要对分块、指令选择、数据布局和算子融合有深入的专业知识,这给程序员带来了巨大负担。在本文中,我们专注于基于分块的AI加速器程序,并提出了Axon,一种用于张量程序的综合超优化器:它使用程序综合从语义规范自动生成目标指令,并探索语义等价的程序变体以选择经验上性能最佳的内核。Axon通过计算图传播算子来发现代数变换,并使用无界张量上的SMT保证所有变换保持语义,无需手工编写的重写规则。然后,它将张量操作降级为目标ISA指令,探索受硬件描述约束的分块配置,并融合算子和指令以最小化内存流量。
英文摘要:
Writing high performance kernels for AI accelerators requires deep expertise in tiling, instruction selection, data layout, and operator fusion placing a significant burden on programmers. In this paper, we focus on tile based AI accelerator programs and present Axon, a synthesizing superoptimizer for tensor programs: it uses program synthesis to automatically generate target instructions from semantics specifications, and explores semantically equivalent program variants to select the best performing kernel empirically. Axon discovers algebraic transformations by propagating operators through computation graphs and uses SMT over unbounded tensors to guarantee that all transformations preserve semantics without requiring hand crafted rewrite rules. It then lowers tensor operations to target ISA instructions, explores tiling configurations constrained by hardware descriptions, and fuses operators and instructions to minimize memory traffic.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。