Fundamental research for improving the practicality of communication-avoiding matrix factorization algorithms

2017 Fiscal Year Final Research Report

• Project/Area Number: 15K16000
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: High performance computing
• Research Institution: Hokkaido University
• Principal Investigator: Fukaya Takeshi 北海道大学, 情報基盤センター, 助教 (30633846)
• Project Period (FY): 2015-04-01 – 2018-03-31
• Keywords: 行列計算 / 高性能計算 / 並列計算 / 通信回避

Outline of Final Research Achievements

In order to reduce the communication cost in large-scale parallel computations, so-called communication-avoiding (CA) algorithms for matrix factorization have been actively studied. In this research, we aimed for improving the practicality of CA algorithms in realistic situations. We investigated fundamental techniques for CA algorithms: for example, those for implementing and tuning CA algorithms. We also compared different CA algorithms. In addition, we studied the performance modeling of CA algorithms.

Free Research Field

高性能計算