首页> 外文会议>High Performance Computing for Computational Science - VECPAR 2008 >An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization
【24h】

An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization

机译:SuperMatrix带Cholesky因式分解的逐块算法

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We pursue the scalable parallel implementation of the factorization of band matrices with medium to large bandwidth targeting SMP and multi-core architectures. Our approach decomposes the computation into a large number of fine-grained operations exposing a higher degree of parallelism. The SuperMatrix run-time system allows an out-of-order scheduling of operations that is transparent to the programmer. Experimental results for the Cholesky factorization of band matrices on two parallel platforms with sixteen processors demonstrate the scalability of the solution.
机译:我们追求针对中型到大型带宽的SMP和多核体系结构的带矩阵分解的可扩展并行实现。我们的方法将计算分解为大量细粒度的运算,从而显示出更高的并行度。 SuperMatrix运行时系统允许对程序员透明的无序操作调度。在带有16个处理器的两个并行平台上对带矩阵进行Cholesky分解的实验结果证明了该解决方案的可扩展性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号