원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.7 No.6
2014.12
pp.257-274
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
According to the traditional stabilized biconjugate gradient algorithm (BiCGSTAB) deficiency in data locality, this paper proposed a QTBiCGSTAB algorithm whose core idea is that recursively divides sparse matrix with quarter tree into sub-matrix and reorders them, to improve the hit ratio of cache and enhance the algorithm’s efficiency. And the idea is good for algorithm being parallized, that is proved by the numerical experiments later. It mainly shows, firstly, QTBiCGSTAB algorithm is more efficiency than BiCGSTAB, and the speedup would reach 1:330. The target division length would be influnced on the algorithm’s performance; Secondly, for large linear system, parallized QTBiCGSTAB is more efficiency than serial’s.
목차
Abstract
1. Introduction
2. Serial QTBiCGSTAB Algorithm
2.1.Serial QTBiCGSTAB Algorithm
2.2. Analyze Efficiency of QTBiCGSTAB
3. Parallelized QTBiCGSTAB Algorithm
3.1.Algorithm Design
3.2. Analysis of the Efficiency of the Parallelized Algorithm
4. Numerical Experiments
4.1. Efficiency of the Serial QTBiCGSTAB Algorithm
4.2.Efficiency of the Parallelized QTBiCGSTAB Algorithm
5. Conclusions
Acknowledgment
References
1. Introduction
2. Serial QTBiCGSTAB Algorithm
2.1.Serial QTBiCGSTAB Algorithm
2.2. Analyze Efficiency of QTBiCGSTAB
3. Parallelized QTBiCGSTAB Algorithm
3.1.Algorithm Design
3.2. Analysis of the Efficiency of the Parallelized Algorithm
4. Numerical Experiments
4.1. Efficiency of the Serial QTBiCGSTAB Algorithm
4.2.Efficiency of the Parallelized QTBiCGSTAB Algorithm
5. Conclusions
Acknowledgment
References
저자정보
참고문헌
자료제공 : 네이버학술정보