.png){kind=icon}
返回
SEMIAUTOMATIC TASK GRAPH CONSTRUCTION FOR H-MATRIX ARITHMETIC
.png){kind=icon}
OA
AI
DOI：10.1137/20M1318808.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new method to construct task graphs for 7c-matrix arithmetic is introduced, which uses the information associated with all tasks of the standard recursive 7c-matrix algorithms, e.g., the block index set of the matrix blocks involved in the computation. Task refinement, i.e., the replacement of tasks by subcomputations, is then used to proceed in the 7c-matrix hierarchy until the matrix blocks containing the actual matrix data are reached. This process is a natural extension of the classical, recursive way in which 7c-matrix arithmetic is defined and thereby simplifies the efficient usage of many-core systems. Numerical examples for model problems with different block structures demonstrate the various properties of the new approach.
Keyword:
hierarchical matrices
task graph
parallel algorithms
many-core processors
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
A sparse matrix arithmetic based on H-matrices.: Part I :: Introduction to H-matrices.png)
COMPUTING
COMPUTINGIF2.8
PREAI
分享收藏Thermodynamic properties of liquid argon at high pressures, calculated from PVT and sound-velocity dataPhysica
PhysicaIF0
PREAI
分享收藏
3-D Mechanical Modeling of 20 T HTS Clover Leaf End Coils—Good Practices and Lessons Learned20 T HTS四叶草形端线圈的3-D机械建模——良好实践与经验教训
PREAI
分享收藏Ramping Loss Analysis of No-Insulation HTS Coil Under External Field Using an Improved Equivalent Circuit Model外场下无绝缘高温超导线圈升流损耗分析的改进等效电路模型
PREAI
分享收藏分享收藏
查看更多内容