Cache optimization of a non-orthogonal joint diagonalization method
スポンサーリンク
概要
- 論文の詳細を見る
The LUJ2D algorithm is a recently proposed numerical solution method for non-orthogonal joint diagonalization problems appearing in signal processing. The original LUJ2D algorithm attains low performance on modern microprocessors since it is dominated by cache ineffective operations. In this study, we propose a cache efficient implementation of the LUJ2D algorithm. The experimental results show that the proposed implementation is about 1.8 times faster than the original one, achieving 21\% of the peak performance on the Opteron 1210 processor using one core.
著者
-
Yamamoto Yusaku
Graduate School of System Informatics, Kobe University
-
HIROTA Yusuke
Graduate School of Information Science and Technology, Osaka University
-
Hirota Yusuke
Graduate School of System Informatics, Kobe University
-
Zhang Shao-Liang
Graduate School of Engineering, Nagoya University
関連論文
- Cache optimization of a non-orthogonal joint diagonalization method
- On Auto-tuned Pre/postprocessing for the Singular Value Decomposition of Dense Square Matrices
- A Resilient Forest-Based Application Level Multicast for Real-Time Streaming