Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Flavio Vella"'
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 32:2970-2982
Modeling the consumption of limited resources, e.g., time or energy, plays a central role on the design of reactive systems such as embedded controllers. To this aim, quantitative objectives are defined on game arenas that can be easily modeled as we
Publikováno v:
Computational Science and Its Applications – ICCSA 2019 ISBN: 9783030242886
ICCSA (1)
ICCSA (1)
Emerging applications such as Deep Learning are often data-driven, thus traditional approaches based on auto-tuners are not performance effective across the wide range of inputs used in practice. In the present paper, we start an investigation of pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::768c184ff0ed40f7e1bf7b6d8f02a46a
http://arxiv.org/abs/2212.05031
http://arxiv.org/abs/2212.05031
Autor:
Grigori Fursin, Anton Lokhmotov, Bruno Carpentieri, Fabiana Zollo, Marco Cianfriglia, Damiano Perri, Osvaldo Gervasi, Paolo Sylos Labini, Cedric Nugteren, Flavio Vella
Publikováno v:
ACM Transactions on Architecture and Code Optimization. 18:1-24
Efficient HPC libraries often expose multiple tunable parameters, algorithmic implementations, or a combination of them, to provide optimized routines. The optimal parameters and algorithmic choices may depend on input properties such as the shapes o
Autor:
Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tětek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michał Podstawski, Grzegorz Kwaśniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler
Publikováno v:
Besta, M, Miglioli, C, Labini, P S, Tetek, J, Iff, P, Kanakagiri, R, Ashkboos, S, Janda, K, Podstawski, M, Kwasniewski, G, Gleinig, N, Vella, F, Mutlu, O & Hoefler, T 2022, ProbGraph : High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations . in Proceedings of SC 2022 : International Conference for High Performance Computing, Networking, Storage and Analysis . IEEE, International Conference for High Performance Computing, Networking, Storage and Analysis, SC, vol. 2022-November, pp. 1-17, 2022 International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2022, Dallas, United States, 13/11/2022 . https://doi.org/10.1109/SC41404.2022.00048
Important graph mining problems such as Clustering are computationally demanding. To significantly accelerate these problems, we propose ProbGraph: a graph representation that enables simple and fast approximate parallel graph mining with strong theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53505069ab1f212588a4bd5c730f6566
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
Triangle count and local clustering coefficient are two core metrics for graph analysis. They find broad application in analyses such as community detection and link recommendation. Current state-of-the-art solutions suffer from synchronization overh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0bac0d28116867b0034a5d487de7394d
Autor:
Paola Lecca, Bruno Carpentieri, Paolo Sylos Labini, Flavio Vella, Emidio Troiani, Attilio Cavezzi
Publikováno v:
2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM).
Publikováno v:
Euro-Par 2021: Parallel Processing ISBN: 9783030856649
Euro-Par
Euro-Par
To respond to the intense computational load of deep neural networks, a plethora of domain-specific architectures have been introduced, such as Google Tensor Processing Units and NVIDIA Tensor Cores. A common feature of these architectures is a hardw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9e892a1a3ed91436fae42e3e7fd3671
http://hdl.handle.net/11577/3413090
http://hdl.handle.net/11577/3413090
Publikováno v:
Declarative Programming and Knowledge Management ISBN: 9783030467135
DECLARE
DECLARE
Answer Set Programming (ASP) has become, the paradigm of choice in the field of logic programming and non-monotonic reasoning. Thanks to the availability of efficient solvers, ASP has been successfully employed in a large number of application domain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27a669f5842f3f795d96fb96900d402a
http://hdl.handle.net/11390/1184643
http://hdl.handle.net/11390/1184643
Publikováno v:
IEEE Transactions on Multi-Scale Computing Systems 4 (2018): 204–215. doi:10.1109/TMSCS.2018.2797195
info:cnr-pdr/source/autori:Bernaschi M.; Bisson M.; Mastrostefano E.; Vella F./titolo:Multilevel parallelism for the exploration of large-scale graphs/doi:10.1109%2FTMSCS.2018.2797195/rivista:IEEE Transactions on Multi-Scale Computing Systems/anno:2018/pagina_da:204/pagina_a:215/intervallo_pagine:204–215/volume:4
info:cnr-pdr/source/autori:Bernaschi M.; Bisson M.; Mastrostefano E.; Vella F./titolo:Multilevel parallelism for the exploration of large-scale graphs/doi:10.1109%2FTMSCS.2018.2797195/rivista:IEEE Transactions on Multi-Scale Computing Systems/anno:2018/pagina_da:204/pagina_a:215/intervallo_pagine:204–215/volume:4
We present the most recent release of our parallel implementation of the BFS and BC algorithms for the study of large scale graphs. Although our reference platform is a high-end cluster of new generation NVIDIA GPUs and some of our optimizations are