Parallel Hierarchical Matrices with Adaptive Cross Approximation on Symmetric Multiprocessing Clusters
スポンサーリンク
概要
- 論文の詳細を見る
We discuss a scheme for hierarchical matrices with adaptive cross approximation on symmetric multiprocessing clusters. We propose a set of parallel algorithms that are applicable to hierarchical matrices. The proposed algorithms are implemented using the flat-MPIand hybrid MPI+OpenMP programming models. The performance of these implementations is evaluated using an electric field analysis computed on two symmetric multiprocessing cluster systems. Although the flat-MPI version gives better parallel scalability when constructing hierarchical matrices, the speed-up reaches a limit in the hierarchical matrix-vector multiplication. We succeeded in developing a hybrid MPI+OpenMP version to improve the parallel scalability. In numerical experiments, the hybrid version exhibits a better parallel speed-up for the hierarchical matrix-vector multiplication up to 256 cores.
- 一般社団法人 情報処理学会の論文
一般社団法人 情報処理学会 | 論文
- Interest Point Detection Based on Stochastically Derived Stability
- Efficient Algorithms for Extracting Pareto-optimal Hardware Configurations in DEPS Framework
- Verification of Substitution Theorem Using HOL (プログラミング Vol.5 No.2)
- Programmable Architectures and Design Methods for Two-Variable Numeric Function Generators
- An Exact Estimation Algorithm of Error Propagation Probability for Sequential Circuits