This thesis deals with the high performance computation problems and more specifically with those of scientific parallel computation for irregular real-world applications. In the first part, we describe a method for overlapping communications on …
The framework of this paper is the parallelization of a plasticity algorithm that uses an implicit method and an incremental approach. More precisely, we will focus on some specific parallel sparse linear algebra algorithms which are the most …
We present and analyze a general algorithm which computes efficient static schedulings of block computations for parallel sparse linear factorization. Our solver, based on a supernodal fan-in approach, is fully driven by this scheduling. We give an …