首页> 外文期刊>ACM Transactions on Architecture and Code Optimization >Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts
【24h】

Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts

机译:使用2D包装布局优化三角形和带状矩阵操作

获取原文
获取原文并翻译 | 示例
           

摘要

Over the past few years, multicore systems have become increasingly powerful and thereby very useful in high-performance computing. However, many applications, such as some linear algebra algorithms, still cannot take full advantage of these systems. This is mainly due to the shortage of optimization techniques dealing with irregular control structures. In particular, the well-known polyhedral model fails to optimize loop nests whose bounds and/or array references are not affine functions. This is more likely to occur when handling sparse matrices in their packed formats. In this article, we propose using 2d-packed layouts and simple affine transformations to enable optimization of triangular and banded matrix operations. The benefit of our proposal is shown through an experimental study over a set of linear algebra benchmarks.
机译:在过去的几年里,多核系统已经变得越来越强大,从而在高性能计算中非常有用。 然而,许多应用程序,例如一些线性代数算法,仍然无法充分利用这些系统。 这主要是由于处理不规则控制结构的优化技术的缺乏。 特别地,众所周知的多面体模型无法优化循环嵌套,其限制和/或阵列引用不仿现函数。 在处理稀疏矩阵以其包装格式时,更有可能发生这种情况。 在本文中,我们建议使用2D包装布局和简单的仿射变换,以实现三角形和带状矩阵操作的优化。 我们提案的好处是通过在一组线性代数基准测试中进行实验研究来显示的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号