In this paper we focus on Jacobi like resolution of the eigenproblem f
or a real symmetric matrix from a parallel performance point of view:
we try to optimize the algorithm working on the communication intensiv
e part of the code. We discuss several parallel implementations and pr
opose an implementation which overlaps the communications by the compu
tations to reach a better efficiency. We show that the overlapping imp
lementation can lead to significant improvements. We conclude by prese
nting our future work.