Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Janda, Kacper"'
Autor:
Besta, Maciej, Miglioli, Cesare, Labini, Paolo Sylos, Tětek, Jakub, Iff, Patrick, Kanakagiri, Raghavendra, Ashkboos, Saleh, Janda, Kacper, Podstawski, Michal, Kwasniewski, Grzegorz, Gleinig, Niels, Vella, Flavio, Mutlu, Onur, Hoefler, Torsten
Publikováno v:
Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis, November 2022
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:
http://arxiv.org/abs/2208.11469
Autor:
Besta, Maciej, Kanakagiri, Raghavendra, Kwasniewski, Grzegorz, Ausavarungnirun, Rachata, Beránek, Jakub, Kanellopoulos, Konstantinos, Janda, Kacper, Vonarburg-Shmaria, Zur, Gianinazzi, Lukas, Stefan, Ioana, Luna, Juan Gómez, Copik, Marcin, Kapp-Schwoerer, Lukas, Di Girolamo, Salvatore, Konieczny, Marek, Blach, Nils, Mutlu, Onur, Hoefler, Torsten
Simple graph algorithms such as PageRank have been the target of numerous hardware accelerators. Yet, there also exist much more complex graph mining algorithms for problems such as clustering or maximal clique listing. These algorithms are memory-bo
Externí odkaz:
http://arxiv.org/abs/2104.07582
Autor:
Besta, Maciej, Vonarburg-Shmaria, Zur, Schaffner, Yannick, Schwarz, Leonardo, Kwasniewski, Grzegorz, Gianinazzi, Lukas, Beranek, Jakub, Janda, Kacper, Holenstein, Tobias, Leisinger, Sebastian, Tatkowski, Peter, Ozdemir, Esref, Balla, Adrian, Copik, Marcin, Lindenberger, Philipp, Kalvoda, Pavel, Konieczny, Marek, Mutlu, Onur, Hoefler, Torsten
Publikováno v:
International Conference on Very Large Data Bases (VLDB), 2021
We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that facilitates evaluating and constructing high-performance graph mining algorithms. First, GMS comes with a benchmark specification based on extensive literature review
Externí odkaz:
http://arxiv.org/abs/2103.03653
Autor:
Besta, Maciej, Carigiet, Armon, Vonarburg-Shmaria, Zur, Janda, Kacper, Gianinazzi, Lukas, Hoefler, Torsten
Publikováno v:
Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis (SC20), November 2020
We develop the first parallel graph coloring heuristics with strong theoretical guarantees on work and depth and coloring quality. The key idea is to design a relaxation of the vertex degeneracy order, a well-known graph theory concept, and to color
Externí odkaz:
http://arxiv.org/abs/2008.11321