• Aucun résultat trouvé

Scheduling Trees of Malleable Tasks for Sparse Linear Algebra

N/A
N/A
Protected

Academic year: 2021

Partager "Scheduling Trees of Malleable Tasks for Sparse Linear Algebra"

Copied!
44
0
0

Texte intégral

Loading

Figure

Figure 1: Example of the decomposition of a task of the DAG of a Cholesky decomposition into smaller kernels.
Figure 2: Timings (points) and model (lines) of QR kernel for M = 1024 Figures 5 and 6 present the same timings for the qr mumps frontal matrix factorization kernel, which is more relevant to this study as it is a basic block for the factorization of spars
Figure 4: Timings (points) and model (lines) of Cholesky kernel N value of α for QR, value of α for QR, value of α
Figure 5: Timings (points) and model (lines) of qr mumps frontal matrix factorization kernel with 1D partitioning.
+7

Références

Documents relatifs

Therefore, the size of the output file f c does not exceed InIdle, that is, the size of all possible input files stored in memory right before the start of the processing of inner

This section presents strategies to schedule rigid tasks under fixed resource allocations. The strategies include both list- based and pack-based scheduling. The results extend

Unit´e de recherche INRIA Lorraine, Technopˆole de Nancy-Brabois, Campus scientifique, ` NANCY 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LES Unit´e de recherche INRIA

For all x, n ∈ N × and for all p > n, if we have xn independant tasks of length 1 to process in parallel with xp processors and we cannot execute more than x nodes at any time,

Schedules are built using the processor allocations encoded in the chromosome, and using a priority list scheduler, where the priorities encoded in the chromosome are used

With the advent of multi-core platforms, research in the field of hard real-time has recently considered parallel software, from the perspective of both worst-case execution time

The two proposed recombination operators follow the same design: the offspring solution is generated by assigning to each task, the machine of one of the neighboring

57 Figure 35: Vue opératoire d’un volumineux adénome parathyroïdien (cervicotomie) (Chirurgie thoracique, HMIMV) ... 58 Figure 37: Radiographie de l’épaule droite