Collaborative Research: SHF: Medium: Co-Optimizing Computation and Data Transformations for Sparse Tensors

协作研究：SHF：中：稀疏张量的协同优化计算和数据转换

• 批准号: 2107135
• 负责人: Amit Jain
• 金额: $ 33万
• 依托单位: Boise State University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2022
• 资助国家: 美国
• 起止时间: 2022-01-01 至 2025-12-31
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2107135&HistoricalAwards=false
• 关键词: Collaborative; Research; SHF; Medium; Co

Sparse tensor computations are central to important applications including computer-assisted drug design, fraud detection, and national security. Timely execution of these applications improves user productivity and reduces the energy consumption associated with each execution. Sparse computations are characterized as having inputs where many or most values are zero. To avoid the inefficiency of storing and computing on zero-valued data, applications only store the nonzeros, with auxiliary data structures to recover their locations. As a result, sparse tensor computations exhibit unpredictable memory-access patterns that include indirection through the auxiliary data structures. Consequently, on today’s computer architectures, performance of sparse tensor computations is completely dominated by the movement of data, through the memory system and across nodes. Data movement is expensive both in terms of execution time and energy expenditure. Optimizing data movement of sparse tensor computations as high-performance architectures have become increasingly diverse — conventional parallel architectures, graphics processors used as parallel accelerators and complex memory systems — creates a performance and productivity challenge for software developers who end up writing low-level architecture-specific code for each platform. The proposed approach simultaneously optimizes how data is organized in memory, how the computation is structured to access the data in a way that reduces data movement, and how the computation and data movement make best use of features of the hardware architectures. Since the nonzero structure of the data is unknown until program execution, the approach also examines runtime information in its decisions. The resulting co-optimization strategy enables a cohesive approach for iteratively making scheduling and data representation transformation decisions for a wide range of sparse computations and incorporating runtime adaptations.This project is developing a programming framework that permits high-level specification of a sparse computation and optimizes it to reduce data movement. It composes data representations, data layouts and storage mappings, and parallel schedules for sparse computations. It employs data dependencies, runtime information, and architecture features to fully bind the final generated code. This approach is intended to enable handling sparse tensor computations with dependences such as sparse triangular solve and many other solvers for systems of linear equations, applying reorderings such as Morton ordering on sparse tensors, and late binding of sparse tensor data representations. The novel and most significant aspects of the research include: (1) composable schedule and data transformations, including data layout transformations and storage mapping; (2) inspector synthesis for runtime data transformations between data representations, layouts, and storage mappings, which are composed with external functions; (3) support for data-dependent tensor computations; and, (4) framework abstractions deployed in the MLIR/LLVM compiler.The researchers are strongly committed to broadening participation in computing and have comprehensive plans to engage the underrepresented groups.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

稀疏张量计算是计算机辅助药物设计、欺诈检测和国家安全等重要应用的核心。及时执行这些应用程序可以提高用户的工作效率并减少与每次执行相关的能耗。稀疏计算的特点是输入中许多或大多数值为零。 为了避免零值数据存储和计算效率低下，应用程序仅存储非零值，并使用辅助数据结构来恢复其位置。 因此，稀疏张量计算表现出不可预测的内存访问模式，其中包括通过辅助数据结构的间接访问。 因此，在当今的计算机架构上，稀疏张量计算的性能完全由数据通过内存系统和跨节点的移动决定。数据移动在执行时间和能源消耗方面都很昂贵。随着高性能架构变得越来越多样化（传统的并行架构、用作并行加速器的图形处理器和复杂的内存系统），优化稀疏张量计算的数据移动给最终为每个平台编写低级架构特定代码的软件开发人员带来了性能和生产力挑战。所提出的方法同时优化了数据在内存中的组织方式、计算的结构如何以减少数据移动的方式访问数据，以及计算和数据移动如何充分利用硬件架构的功能。由于数据的非零结构在程序执行之前是未知的，因此该方法还在其决策中检查运行时信息。 由此产生的协同优化策略支持一种内聚方法，用于迭代地为各种稀疏计算制定调度和数据表示转换决策，并结合运行时适应。该项目正在开发一个编程框架，该框架允许稀疏计算的高级规范并对其进行优化以减少数据移动。 它由数据表示、数据布局和存储映射以及稀疏计算的并行调度组成。 它利用数据依赖性、运行时信息和体系结构功能来完全绑定最终生成的代码。此方法旨在能够处理具有依赖性的稀疏张量计算，例如稀疏三角求解器和线性方程组的许多其他求解器，在稀疏张量上应用重新排序（例如莫顿排序）以及稀疏张量数据表示的后期绑定。 该研究新颖且最重要的方面包括：（1）可组合的调度和数据转换，包括数据布局转换和存储映射； (2) 检查器综合，用于数据表示、布局和存储映射之间的运行时数据转换，这些数据由外部函数组成； (3) 支持数据相关的张量计算； (4) MLIR/LLVM 编译器中部署的框架抽象。研究人员坚定地致力于扩大对计算的参与，并制定了全面计划来吸引代表性不足的群体。该奖项反映了 NSF 的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Sparse Format Conversion and Code Synthesis

稀疏格式转换和代码合成

• 发表时间: 2023
• 期刊: ProQuest dissertations theses global
• 作者: Tobi Popoola

Polyhedral Specification and Code Generation of Sparse Tensor Contraction with Co-iteration

• DOI: 10.1145/3566054
• 发表时间: 2022-08
• 期刊: ACM Transactions on Architecture and Code Optimization
• 影响因子: 1.6
• 作者: Tuowen Zhao;Tobi Popoola;Mary W. Hall;C. Olschanowsky;M. Strout

Techniques for Managing Polyhedral Dataflow Graphs

管理多面体数据流图的技术

• DOI: 10.1007/978-3-030-99372-6_9
• 发表时间: 2021
• 期刊: LCPC 2021
• 作者: Shankar, Ravi;Orenstein, Aaron;Rift, Anna;Popoola, Tobi;MacDonald;Yang, Shuai;Mikesell, T. Dylan;Olschanowsky, Catherine
• 通讯作者: Olschanowsky, Catherine

Portable Sparse Polyhedral Framework Code Generation Using Multi Level Intermediate Representation

使用多级中间表示的便携式稀疏多面体框架代码生成

• 发表时间: 2023
• 期刊: ProQuest dissertations theses global
• 作者: Aaron St. George

Code Synthesis for Sparse Tensor Format Conversion and Optimization

稀疏张量格式转换和优化的代码综合

• 发表时间: 2023
• 期刊: International Symposium on Code Generation and Optimization
• 作者: Popoola, Tobi;Zhao, Tuowen;St. George, Aaron;Bhetwal, Kalyan;Strout, Michelle;Hall, Mary;Olschanowsky, Catherine
• 通讯作者: Olschanowsky, Catherine