Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Oltchik, Yishai"'
Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct parametric structures. This parametric graph template representation all
Externí odkaz:
http://arxiv.org/abs/2307.08420
Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, which are defined by templates that generate structure by way of repeat
Externí odkaz:
http://arxiv.org/abs/2011.07001
Autor:
Oltchik, Yishai, Schwartz, Oded
Network contention frequently dominates the run time of parallel algorithms and limits scaling performance. Most previous studies mitigate or eliminate contention by utilizing one of several approaches: communication-minimizing algorithms; hotspot-av
Externí odkaz:
http://arxiv.org/abs/2005.14150
Autor:
Besta, Maciej, Weber, Simon, Gianinazzi, Lukas, Gerstenberger, Robert, Ivanov, Andrey, Oltchik, Yishai, Hoefler, Torsten
Publikováno v:
Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis (SC19), November 2020. Best Paper Finalist, Best Student Paper Finalist
We propose Slim Graph: the first programming model and framework for practical lossy graph compression that facilitates high-performance approximate graph processing, storage, and analytics. Slim Graph enables the developer to express numerous compre
Externí odkaz:
http://arxiv.org/abs/1912.08950
Autor:
Besta, Maciej, Weber, Simon, Gianinazzi, Lukas, Gerstenberger, Robert, Ivanov, Andrey, Oltchik, Yishai, Hoefler, Torsten
Publikováno v:
Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=sygma_______::fe9627e3c41903a2b6968d88aa1db810