ps: I have to locate the thread about the conversion routine, Ill get back to you later.
in general, if we are talking about solution phase, the performance should be the same because of this phase is not threaded. More precisely, the solution phase is treaded only for many RHS. And this performance results, of course, will not depends on which compiler options were used.--Gennady
The total solution time what do you mean by that? Is this the all execution time for all calculation phases, say for all phase==(11 + 22 + 33) ?
Hi Gennady, I was just doing some reading in the Pardiso manula (university of Basel) and read the following,
(o) Reproducibility of exact numerical results staon multi-core architectures. The solver is now able to compute the exact bit identical solution independent
on the number of cores without effecting the scalability. Here are some
results for a nonlinear FE model with 500'000 elements.
Intel MKL PARDISO 10.2
1 core - factor: 17.980 sec., solve: 1.13 sec.
2 cores - factor: 9.790 sec., solve: 1.13 sec.
4 cores - factor: 6.120 sec., solve: 1.05 sec.
8 cores - factor: 3.830 sec., solve: 1.05 sec.
U Basel PARDISO 4.0.0:
1 core - factor: 16.820 sec., solve: 1.09 sec.
2 cores - factor: 9.021 sec., solve: 0.67 sec.
4 cores - factor: 5.186 sec., solve: 0.53 sec.
8 cores - factor: 3.170 sec., solve: 0.43 sec.
This method is currently only working for symmetric indefinite matrices.
This seems to be consistent with what I am experiencing. Do we get updated versions of Pardiso from Basel ?