Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Partitionnement de graphe"'
In silico studying a genome requires two steps: sequencing it with cloning and cutting the genome in several reads, and then, assembling the reads. It is well known that the number of sequencing errors is proportional to the reads' size. However, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::39d3d49623a932dc83e485d7e3f530df
https://hal.science/hal-03007132
https://hal.science/hal-03007132
Publikováno v:
[Research Report] RR-9115, Inria Grenoble Rhône-Alpes. 2019, pp.1-34
Scientific applications are commonly modeled as the processing of directed acyclicgraphs of tasks, and for some of them, the graph takes the special form of a rooted tree. Thistree expresses both the computational dependencies between tasks and their
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::ddc5aa5a2711744dcb86e6e69649a3bb
https://hal.inria.fr/hal-01644352v4/document
https://hal.inria.fr/hal-01644352v4/document
Autor:
Pellegrini, François, Lachat, Cédric
Publikováno v:
[Research Report] RR-9135, Inria Bordeaux Sud-Ouest. 2017, pp.16
Data locality is a critical issue in order to achieve performance on today's high-end parallel machines. As these machines are highly non-uniform, distributing computations across their processing elements does not only require to minimize inter-proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::330d27332db11980a5969e9358c58b95
https://inria.hal.science/hal-01671156v2/document
https://inria.hal.science/hal-01671156v2/document
Autor:
Predari, Maria
Dans le contexte du calcul scientique, l'équilibrage de la charge est un problème crucial qui conditionne la performance des simulations numériques parallèles. L'objectif est de répartir la charge de travail entre un nombre de processeurs donné
Externí odkaz:
http://www.theses.fr/2016BORD0369/document
Autor:
Predari, Maria
Publikováno v:
Other [cs.OH]. Université de Bordeaux, 2016. English. ⟨NNT : 2016BORD0369⟩
Load balancing is an important step conditioning the performance of parallel applications. The goal is to distribute roughly equal amounts of computational load across a number of processors, while minimising interprocessor communication. A common ap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::64ae6c02e5e03b9455a9fbdd711ab31c
https://tel.archives-ouvertes.fr/tel-01518956v2/file/PREDARI_MARIA_2016.pdf
https://tel.archives-ouvertes.fr/tel-01518956v2/file/PREDARI_MARIA_2016.pdf
Autor:
Nguyen, Dang Phuong
Le problème de partitionnement de graphe est un problème fondamental en optimisation combinatoire. Le problème revient à décomposer l'ensemble des nœuds d'un graphe en plusieurs sous-ensembles disjoints de nœuds (ou clusters), de sorte que la
Externí odkaz:
http://www.theses.fr/2016PA066697/document
Autor:
Ma, Fuda
Les problèmes de partitionnement de graphique sont une classe bien connue des problèmes d'optimisation combinatoire NP-difficiles avec un large éventail d'applications, telles que la conception de plans VLSI, la physique statistique, la planificat
Externí odkaz:
http://www.theses.fr/2016ANGE0010/document
Autor:
Ma, Fuda
Publikováno v:
Computational Complexity [cs.CC]. Université d'Angers, 2016. English. ⟨NNT : 2016ANGE0010⟩
Graph partitioning problems are a class of well-known NP-hard combinatorial optimization problems with a wide range of applications, such as VLSI layout design, statistical physics, sports team scheduling, image segmentation, and protein conformation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::823f255346e1fc00af27ee141eb61693
https://tel.archives-ouvertes.fr/tel-01479043
https://tel.archives-ouvertes.fr/tel-01479043
Autor:
Casadei, Astrid
Dans cette thèse, nous nous intéressons à la résolution parallèle de grands systèmes linéaires creux. Nous nous focalisons plus particulièrement sur les solveurs linéaires creux hybrides directs itératifs tels que HIPS, MaPHyS, PDSLIN ou Sh
Externí odkaz:
http://www.theses.fr/2015BORD0186/document
Autor:
Pellegrini, François, Lachat, Cédric
Publikováno v:
SIAM Conference on Computational Science & Engineering
SIAM Conference on Computational Science & Engineering, SIAM, Mar 2015, Salt Lake City, United States
[Research Report] RR-9135, Inria Bordeaux Sud-Ouest. 2017, pp.16
SIAM Conference on Computational Science & Engineering, SIAM, Mar 2015, Salt Lake City, United States
[Research Report] RR-9135, Inria Bordeaux Sud-Ouest. 2017, pp.16
Data locality is a critical issue in order to achieve performance on today's high-end parallel machines. As these machines are highly non-uniform, distributing computations across their processing elements does not only require to minimize inter-proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ac5fe65817813cebe4a1ef2c64f22fa2
https://inria.hal.science/hal-01253509
https://inria.hal.science/hal-01253509