Zobrazeno 1 - 8
of 8
pro vyhledávání: '"M. Yusuf Özkaya"'
Autor:
M. Yusuf Özkaya, Ümit V. Çatalyürek, Hasan Metin Aktulga, Abdullah Alperen, Afibuzzaman, Fazlay Rabbi
Publikováno v:
ICPP
Recently, several task-parallel programming models have emerged to address the high synchronization and load imbalance issues as well as data movement overheads in modern shared memory architectures. OpenMP, the most commonly used shared memory paral
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e25c40f01a20b5047a1d3b0e3f96b5f
https://doi.org/10.1145/3472456.3472476
https://doi.org/10.1145/3472456.3472476
Publikováno v:
IPDPS Workshops
Graphs are commonly used to model the relationships between various entities. These graphs can be enormously large and thus, scalable graph analysis has been the subject of many research efforts. To enable scalable analytics, many researchers have fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a9fd00216de93a02f94f5059e411eaf
https://doi.org/10.1109/ipdpsw50202.2020.00051
https://doi.org/10.1109/ipdpsw50202.2020.00051
Publikováno v:
HiPC
Data movement is an important bottleneck against efficiency and energy consumption in large-scale sparse matrix computations that are commonly used in linear solvers, eigensolvers and graph analytics. We introduce a novel task-parallel sparse solver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4b49e27147958c06fc34cd311fced47
https://doi.org/10.1109/hipc.2019.00052
https://doi.org/10.1109/hipc.2019.00052
Publikováno v:
SIAM Journal on Scientific Computing
SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2019, 41 (4), pp.A2117-A2145. ⟨10.1137/18M1176865⟩
SIAM Journal on Scientific Computing, 2019, 41 (4), pp.A2117-A2145. ⟨10.1137/18M1176865⟩
SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2019, 41 (4), pp.A2117-A2145. ⟨10.1137/18M1176865⟩
SIAM Journal on Scientific Computing, 2019, 41 (4), pp.A2117-A2145. ⟨10.1137/18M1176865⟩
International audience; We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3079db3343594c2de28202c6e344faed
https://hal.inria.fr/hal-02306566/document
https://hal.inria.fr/hal-02306566/document
Publikováno v:
ASONAM
The identification of critical nodes in a graph is a fundamental task in network analysis. Centrality measures are commonly used for this purpose. These methods rely on two assumptions that restrict their applicability. First, they only depend on the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::059f1e39e9397d5f74c7c54922bd4435
https://doi.org/10.1109/asonam.2018.8508323
https://doi.org/10.1109/asonam.2018.8508323
Publikováno v:
[Research Report] RR-9185, Inria Grenoble Rhône-Alpes. 2018, pp.1-34
IPDPS 2019-33rd IEEE International Parallel & Distributed Processing Symposium
IPDPS 2019-33rd IEEE International Parallel & Distributed Processing Symposium, May 2019, Rio de Janeiro, Brazil. pp.155-165, ⟨10.1109/IPDPS.2019.00026⟩
IPDPS
IPDPS 2019-33rd IEEE International Parallel & Distributed Processing Symposium
IPDPS 2019-33rd IEEE International Parallel & Distributed Processing Symposium, May 2019, Rio de Janeiro, Brazil. pp.155-165, ⟨10.1109/IPDPS.2019.00026⟩
IPDPS
When scheduling a directed acyclic graph (DAG) of tasks on computationalplatforms, a good trade-off between load balance and data locality isnecessary. List-based scheduling techniques are commonly used greedy approachesfor this problem. The downside
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2da0b56112bfaa50e4c7fcce0ea57ac5
https://inria.hal.science/hal-01817501v3/document
https://inria.hal.science/hal-01817501v3/document
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.