快速且融合:一种最优融合感知的映射器用于加速器设计
Fast and Fusiest: An Optimal Fusion-Aware Mapper for Accelerator Design
AI总结:
本文提出FFM映射器,通过剪枝非最优映射快速找到最优融合映射,实现能量延迟乘积降低1.8倍,比现有状态最先进加速器更高效。
摘要:
设计低延迟和低功耗的张量代数加速器必须优化数据移动和操作在加速器架构中的调度(即映射)。关键的映射优化是融合,即在工作负载中计算步骤之间保持数据在芯片上,这已被证明可以减少能量和延迟,通过减少昂贵的芯片外数据移动。然而,最优融合选择取决于工作负载和工作负载形状,而一个搜索最佳映射的映射器可以显著提高能量和延迟。然而,先前的映射器无法在可行运行时间内找到具有融合(即融合映射)的最佳映射,因为需要搜索的融合映射数量随着工作负载中计算步骤的数量呈指数增长。在本文中,我们介绍Fast and Fusiest Mapper(FFM),一种用于快速找到张量代数工作负载的最优映射的映射器。FFM通过剪枝映射的子集(即部分映射)来缩小搜索空间,这些子集已被证明永远不会成为最优映射的一部分,从而快速消除包含这些部分映射的所有次优映射。然后FFM将部分映射连接起来构建最优融合映射。使用FFM,我们证明与TransFusion(一种具有手动优化融合的状态最先进加速器)相比,能量延迟乘积(EDP)可减少高达1.8倍。此外,我们表明FFM比先前的自动映射器TileFlow和SET快几个数量级(>10,000倍),并且在相同运行时间内,EDP减少超过2倍。
英文摘要:
A low-latency and energy-efficient tensor algebra accelerator design must optimize how data movement and operations are scheduled (i.e., mapped) in the accelerator architecture. A key mapping optimization is fusion, meaning holding data on-chip between computation steps in the workload, which has been shown to reduce energy and latency by reducing expensive off-chip data movement. However, the optimal fusion choice depends on the workload and workload shape, and a mapper, which searches for the optimal mapping, can improve energy and latency significantly. However, prior mappers cannot find optimal mappings with fusion (i.e., fused mappings) in a feasible runtime because the number of fused mappings to search increases exponentially with the number of computation steps in the workload. In this paper, we introduce the Fast and Fusiest Mapper (FFM), a mapper to quickly find optimal mappings in a comprehensive fused mapspace for tensor algebra workloads. FFM shrinks the search space by pruning subsets of mappings (i.e., partial mappings) that are shown to never be a part of optimal mappings, quickly eliminating all suboptimal mappings containing those partial mappings. Then FFM joins partial mappings to construct optimal fused mappings. Using FFM, we demonstrate an energy-delay-product (EDP) reduction by up to $1.8\times$ compared to TransFusion, a state-of-the-art accelerator with hand-optimized fusion. Moreover, we show that FFM finds mappings orders of magnitude faster ($>10,000\times$) than prior automated mappers TileFlow and SET, and given the same runtime, reduces EDP by $>2\times$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。