首页> 外文期刊>CONCURRENCY PRACTICE & EXPERIENCE >The design and implementation of the parallel out-of-core ScaLAPACKLU, QR, and Cholesky factorization routines
【24h】

The design and implementation of the parallel out-of-core ScaLAPACKLU, QR, and Cholesky factorization routines

机译:并行核外ScaLAPACKLU,QR和Cholesky分解程序的设计和实现

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

摘要

This paper describes the design and implementation of three core factorization routines-LU, QR, and Cholesky-included in the out-of-core extension of ScaLAPACK. These routines allow the factorization And solution of a dense system that is too large to fit entirely in physical memory. The full matrix is stored On disk and the factorization routines transfer sub-matrice panels into memory. The 'left-looking' column- Oriented variant of the factorization algorithm is implemented to reduce the disk I/O traffic. The routines Are implemented using a portable I/O interface and utilize high-performance ScaLAPACK factorization Routines as in-core computational kernels.
机译:本文介绍了ScaLAPACK的核心扩展中包括的三个核心分解例程(LU,QR和Cholesky)的设计和实现。这些例程允许密集系统的分解和求解,该系统太大而无法完全容纳在物理内存中。完整矩阵存储在磁盘上,分解例程将子矩阵面板传输到内存中。实现“面向左”列的因式分解算法变体可减少磁盘I / O流量。该例程使用便携式I / O接口实现,并利用高性能ScaLAPACK分解例程作为内核计算内核。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号