Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

About analysis of large problems of structural mechanics on multi-core computers

Autor: S.Yu. Fialko

Publikováno v: Инженерно-строительный журнал, Vol 40, Iss 5, Pp 116-124 (2013)

The sparse direct solvers as well as iterative methods are considered for analysis of large-scale finite element problems of structural mechanics on multi-core computers. The parallel preconditioned conjugate gradient method, based on sparse incomple

Externí odkaz: https://doaj.org/article/cfab1489e8e941c6bdab627081be4778

Deciding Non-Compressible Blocks in Sparse Direct Solvers using Incomplete Factorization

Autor: Korkmaz, Esragul, Faverge, Mathieu, Pichon, Grégoire, Ramet, Pierre

Publikováno v: HiPC 2021-28th IEEE International Conference on High Performance Computing, Data, and Analytics
HiPC 2021-28th IEEE International Conference on High Performance Computing, Data, and Analytics, Dec 2021, Bangalore, India. pp.1-10
[Research Report] RR-9396, Inria Bordeaux-Sud Ouest. 2021, pp.16
HiPC 2021-28th IEEE International Conference on High Performance Computing, Data, and Analytics, Dec 2021, Bangalore, India. pp.1-10, ⟨10.1109/HiPC53243.2021.00024⟩

Low-rank compression techniques are very promising for reducing memory footprintand execution time on a large spectrum of linear solvers. Sparse direct supernodal approaches areone these techniques. However, despite providing a very good scalability

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::241de7fa5f24321a04277461a9937b66
https://hal.inria.fr/hal-03152932v2

Improving mapping for sparse direct solvers: A trade-off between data locality and load balancing

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

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

Implementing multifrontal sparse solvers for multicore architectures with Sequential Task Flow runtime systems

Autor: Alfredo Buttari, Emmanuel Agullo, Florent Lopez, Abdou Guermouche

Publikováno v: ACM Transactions on Mathematical Software
ACM Transactions on Mathematical Software, Association for Computing Machinery, 2016, ⟨10.1145/2898348⟩
ACM Transactions on Mathematical Software, 2016, ⟨10.1145/2898348⟩

International audience; To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG parallelism regained popularity in the high performance, scientific computing community.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3aedb19347d6fc10fe8eccde2badd5f
https://hal.inria.fr/hal-01333645/file/toms_qrm_starpu.pdf