【24h】

Cache Blocking for Linear Algebra Algorithms

机译:线性代数算法缓存阻塞

获取原文

摘要

We briefly describe Cache Blocking for Dense Linear Algebra Algorithms on computer architectures since about 1985. Before that one had uniform memory architectures. The Cray I machine was the last holdout. We cover the where, when, what, how and why of Cache Blocking. Almost all computer manufacturers have recently (about seven years ago) dramatically changed their computer architectures to produce Multicore (MC) processors It will be seen that the arrangement in memory of the submatrices A_(ij) of A is a critical factor for obtaining high performance. From a practical point of view, this work is very important as it will allow existing codes using LAPACK and ScaLAPACK to remain usable by new versions of LAPACK and ScaLAPACK.
机译:自1985年以来,我们简要介绍了计算机架构上的密集线性代数算法的缓存阻断。在那个有统一的内存架构之前。 CRAY I机器是最后一个扑扣。我们涵盖缓存阻止的何处,何时,何时,如何以及为什么和原理。最近(大约七年前)几乎所有电脑制造商都大大改变了他们的计算机架构来生产多核(MC)处理器,可以看出,内存的内存A_(IJ)的安排是获得高性能的关键因素。从实际的角度来看,这项工作非常重要,因为它将允许使用Lapack和ScalaCack的现有代码,以便通过新版本的Lapack和ScalaCACK保持可用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号