GEMMFIP:在BLIS中统一GEMM
GEMMFIP: Unifying GEMM in BLIS
摘要:
矩阵库通常专注于为被认为是“小”或“大”的问题实现高性能,因为这两种情况往往对不同的优化策略响应最好。我们提出了一个统一的技术,实现矩阵运算,如一般矩阵乘法(GEMM),可以实现高性能的大小和大小的问题。关键是融合打包(一种将数据复制到内存中连续布局的操作,这对大型矩阵性能至关重要)与第一次计算“通过”该数据。这提高了整个问题大小范围的性能。因此,调优通用库变得更简单,因为它消除了在“小矩阵”策略和“大矩阵”策略之间进行选择的仔细表达和参数化逻辑的需要。一个原型实现的技术与BLAS-like库实例化软件(BLIS)框架的描述和性能的范围内的架构报告。
英文摘要:
Matrix libraries often focus on achieving high performance for problems considered to be either "small" or "large", as these two scenarios tend to respond best to different optimization strategies. We propose a unified technique for implementing matrix operations like general matrix multiplication (GEMM) that can achieve high performance for both small and large problem sizes. The key is to fuse packing -- an operation that copies data to a contiguous layout in memory and which is critical for large matrix performance -- with the first computational "pass" over that data. This boosts performance across the problem size spectrum. As a result, tuning general-purpose libraries becomes simpler since it obviates the need to carefully express and parameterize logic that chooses between a "small matrix" strategy and a "large matrix" strategy. A prototype implementation of the technique built with the BLAS-like Library Instantiation Software (BLIS) framework is described and performance on a range of architectures is reported.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。