Hi, > In principle I see several different possibilities how to do that. One could > either use tasks or threads to solve the linear systems simultaneously, or > use Trilinos or PETSc to solve them one after another, but using multiple > MPI Processes.
The first options has the advantage that there is no communication required between the threads. The disadvantage is, that you need the memory to store all matrices at the same time. The second case will be a bit slower, but you can only keep one L_i around at a time. > I did some tests with Tasks [...] However I only observe a speedup of <= 10 > % over the serial solution, which I find a bit disappointing. How do you measure that? (You have to make sure to compare wall clock time) One option is to use the linux tool "time". How many seconds does your problem take total (in mustn't be too fast to get reliable results)? Which parts are done in parallel? What kind of load does "top" show while your code is running? -- Timo Heister http://www.math.tamu.edu/~heister/ _______________________________________________ dealii mailing list http://poisson.dealii.org/mailman/listinfo/dealii
