• Aucun résultat trouvé

Introduction of shared-memory parallelism in a distributed-memory multifrontal solver

N/A
N/A
Protected

Academic year: 2021

Partager "Introduction of shared-memory parallelism in a distributed-memory multifrontal solver"

Copied!
39
0
0

Texte intégral

Loading

Figure

Figure 1: Structure of a frontal matrix.
Figure 2: One step in the construction of the layer L th .
Figure 3: Grid and benchmark on one core of hidalgo.
Figure 4: 2D vs 3D: Simulated time as a function of the number of nodes in the L th layer for two matrices of order 1 million for the AlgTime algorithm.
+7

Références

Documents relatifs

It has also shown that distributed shared memories enforcing consistency criteria weaker than PRAM are prone to ecient implementation based on partial replication. The power of

In this global address space, a chunk of data can be localized by a tuple of two elements: the aforementioned data locality, which is also called the process the data has affinity

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Joint International Conference on Supercomputing in Nuclear Applications and Monte Carlo 2013 (SNA + MC 2013) La Cité des Sciences et de l’Industrie, Paris, France, October

This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory

Therefore, for the largest memory bounds, the original graph being itself a valid partial serialization, all the normalized critical paths equal 1. When a method fails to find

This problem is in NP as given a partial serialization of a graph G for a memory bound M, one can check in polynomial time that it is valid: simply compute its maximum peak

Le dommage causé par ces erreurs peut être extrêmement grave et impossible à corriger par la suite, une fois que les données incorrectes ont été répandues (voire même