arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.10482cs.PLcs.MScs.SC
收藏

结构张量代数的编译

Compiling Structured Tensor Algebra

Mahdi Ghorbani, Mathieu Huot, Shideh Hashemian, Amir Shaikhha

摘要:

张量代数对于各种计算领域中的数据密集型工作负载至关重要。计算科学家面临着一个权衡的专业化程度提供的密集张量代数和算法效率,利用稀疏张量提供的结构。本文介绍了StructTensor,一个在编译时符号计算结构的框架。这是由结构化张量统一表示(STUR)实现的,STUR是一种中间语言,可以捕获张量计算及其稀疏性和冗余结构。通过无损张量计算的数学观点,我们表明,我们的符号结构计算和相关的优化是合理的。最后,对于不同的张量计算工作负载和结构,我们通过实验展示了如何捕获符号结构,从而超越密集和稀疏张量代数的最先进框架。

英文摘要:

Tensor algebra is essential for data-intensive workloads in various computational domains. Computational scientists face a trade-off between the specialization degree provided by dense tensor algebra and the algorithmic efficiency that leverages the structure provided by sparse tensors. This paper presents StructTensor, a framework that symbolically computes structure at compilation time. This is enabled by Structured Tensor Unified Representation (STUR), an intermediate language that can capture tensor computations as well as their sparsity and redundancy structures. Through a mathematical view of lossless tensor computations, we show that our symbolic structure computation and the related optimizations are sound. Finally, for different tensor computation workloads and structures, we experimentally show how capturing the symbolic structure can result in outperforming state-of-the-art frameworks for both dense and sparse tensor algebra.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑