Cet article décrit une partie de nos travaux sur la rśolution directe parallèle de grands systm̀es lin'íres creux. Il pr'eńte sa mise en øe uvre sur des architectures `b̀ase de nøe uds SMP, et plus particuli`em̀ent des techniques de gestion efficace …
Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. This paper considers the block partitioning and scheduling problem for sparse …
Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. In this work, we consider the block partitioning and scheduling problem for …
La résolution de grands systèmes lináires creux est un point crucial dans de nombreuses applications industrielles et scientifiques. Notre travail porte sur le partionnement et la distribution de grandes matrices creuses pour la factorisation $LDL^t$ …
Solving large sparse symmetric positive definite systems of linear equations is a crucial and time-consuming step, arising in many scientific and engineering applications. In this work, we consider the block partitioning and scheduling problem for …
This thesis initially concerned the parallelization of the OSSAU software code from CEA/CESTA. The application domain of this software is the vectorized structural mechanics; the code itself is non linear in time and in two or three dimensions. This …