We consider on the performance evaluation of the (M)ICCG method with fill-in on some vector supercomputers. The performance of the (M)ICCG method with fill-in depends on the convergence rate, vector length and especially memory bank conflict. First we show the deterioration of performance due to the effect of memory bank conflict on vector supercomputers. Secondly we show programing techniques without list-vectors in the forward and backward substitutions. Finally we propose a method to evaluate fairly the performance of the (M)ICCG methods with fill-in on vector supercomputers.
抄録全体を表示