Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Solveurs directs creux"'
Publikováno v:
Future Generation Computer Systems
Future Generation Computer Systems, 2022, 130, pp.307-320. ⟨10.1016/j.future.2021.12.018⟩
[Research Report] RR-9368, INRIA. 2020
Future Generation Computer Systems, Elsevier, In press
Future Generation Computer Systems, 2022, 130, pp.307-320. ⟨10.1016/j.future.2021.12.018⟩
[Research Report] RR-9368, INRIA. 2020
Future Generation Computer Systems, Elsevier, In press
Sparse direct solvers using Block Low-Rank compression have been proven efficient to solve problems arising in many real-life applications. Improving those solvers is crucial for being able to 1) solve larger problems and 2) speed up computations. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f63db4c7540f15de729501627227b184
https://doi.org/10.1016/j.future.2021.12.018
https://doi.org/10.1016/j.future.2021.12.018
Autor:
Gou, Changjiang
Publikováno v:
Distributed, Parallel, and Cluster Computing [cs.DC]. Université de Lyon; East China normal university (Shanghai), 2020. English. ⟨NNT : 2020LYSEN047⟩
This thesis focuses on multi-objective optimization problems arising when running scientific applications on high performance computing platforms and streaming applications on embedded systems. These optimization problems are all proven to be NP-comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::8d5853f8b02cbf2242e080a3749033d9
https://tel.archives-ouvertes.fr/tel-03064581
https://tel.archives-ouvertes.fr/tel-03064581
Autor:
Gou, Changjiang
Publikováno v:
Distributed, Parallel, and Cluster Computing [cs.DC]. Université de Lyon; East China normal university (Shanghai), 2020. English. ⟨NNT : 2020LYSEN047⟩
This thesis focuses on multi-objective optimization problems arising when running scientific applications on high performance computing platforms and streaming applications on embedded systems. These optimization problems are all proven to be NP-comp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8d5853f8b02cbf2242e080a3749033d9
https://theses.hal.science/tel-03064581
https://theses.hal.science/tel-03064581
Autor:
Gou, Changjiang, Al Zoobi, Ali, Benoit, Anne, Faverge, Mathieu, Marchal, Loris, Pichon, Grégoire, Ramet, Pierre
Publikováno v:
EuroPar 2020-26th International European Conference on Parallel and Distributed Computing
EuroPar 2020-26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. pp.1-16
[Research Report] RR-9328, Inria Rhône-Alpes. 2020, pp.21
EuroPar 2020-26th International European Conference on Parallel and Distributed Computing, Aug 2020, Warsaw / Virtual, Poland. pp.1-16
[Research Report] RR-9328, Inria Rhône-Alpes. 2020, pp.21
In order to express parallelism, parallel sparse direct solvers take advantage of the elimination tree to exhibit tree-shaped task graphs, where nodes represent computational tasks and edges represent data dependencies. One of the pre-processing stag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::84d2600c7a50648cd9e61b117ea6aae0
https://inria.hal.science/hal-02973315/file/paper.pdf
https://inria.hal.science/hal-02973315/file/paper.pdf
Autor:
Gou, Changjiang, Al Zoobi, Ali, Benoit, Anne, Faverge, Mathieu, Marchal, Loris, Pichon, Grégoire, Ramet, Pierre
Publikováno v:
[Research Report] RR-9328, Inria Rhône-Alpes. 2020, pp.21
In order to express parallelism, parallel sparse direct solvers take advantage of the elimination tree to exhibit tree-shaped task graphs, where nodes represent computational tasks and edges represent data dependencies. One of the pre-processing stag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::752a6626c1b249a0a0affe04234d93ea
https://hal.inria.fr/hal-02491495
https://hal.inria.fr/hal-02491495