Zobrazeno 41 - 50
of 115
pro vyhledávání: '"Besta, Maciej"'
Autor:
Besta, Maciej, Hoefler, Torsten
Publikováno v:
Proceedings of the 24th ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC'15), 2015
We propose Atomic Active Messages (AAM), a mechanism that accelerates irregular graph computations on both shared- and distributed-memory machines. The key idea behind AAM is that hardware transactional memory (HTM) can be used for simple and efficie
Externí odkaz:
http://arxiv.org/abs/2010.09135
Autor:
Kwasniewski, Grzegorz, Ben-Nun, Tal, Ziogas, Alexandros Nikolaos, Schneider, Timo, Besta, Maciej, Hoefler, Torsten
Dense linear algebra kernels, such as linear solvers or tensor contractions, are fundamental components of many scientific computing applications. In this work, we present a novel method of deriving parallel I/O lower bounds for this broad family of
Externí odkaz:
http://arxiv.org/abs/2010.05975
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
Autor:
Besta, Maciej, Domke, Jens, Schneider, Marcel, Konieczny, Marek, Di Girolamo, Salvatore, Schneider, Timo, Singla, Ankit, Hoefler, Torsten
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems (TPDS), 2021
The recent line of research into topology design focuses on lowering network diameter. Many low-diameter topologies such as Slim Fly or Jellyfish that substantially reduce cost, power consumption, and latency have been proposed. A key challenge in re
Externí odkaz:
http://arxiv.org/abs/2007.03776
Publikováno v:
Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis, pages 53:1--53:12, November 2013
Modern interconnects offer remote direct memory access (RDMA) features. Yet, most applications rely on explicit message passing for communications albeit their unwanted overheads. The MPI-3.0 standard defines a programming interface for exploiting RD
Externí odkaz:
http://arxiv.org/abs/2001.07747
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems (TPDS), 2022
Graph processing has become an important part of various areas of computing, including machine learning, medical applications, social network analysis, computational sciences, and others. A growing amount of the associated graph processing workloads
Externí odkaz:
http://arxiv.org/abs/1912.12740
Autor:
Besta, Maciej, Hoefler, Torsten
Publikováno v:
Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis, November 2014
We introduce a high-performance cost-effective network topology called Slim Fly that approaches the theoretically optimal network diameter. Slim Fly is based on graphs that approximate the solution to the degree-diameter problem. We analyze Slim Fly
Externí odkaz:
http://arxiv.org/abs/1912.08968
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, Kanakagiri, Raghavendra, Mustafa, Harun, Karasikov, Mikhail, Rätsch, Gunnar, Hoefler, Torsten, Solomonik, Edgar
Publikováno v:
Proceedings of the 34st IEEE International Parallel and Distributed Processing Symposium (IPDPS'20), 2020
The Jaccard similarity index is an important measure of the overlap of two sets, widely used in machine learning, computational genomics, information retrieval, and many other areas. We design and implement SimilarityAtScale, the first communication-
Externí odkaz:
http://arxiv.org/abs/1911.04200
Autor:
Besta, Maciej, Hoefler, Torsten
Publikováno v:
Proceedings of the 29th ACM International Conference on Supercomputing (ACM ICS'15), 2015
Remote memory access (RMA) is an emerging high-performance programming model that uses RDMA hardware directly. Yet, accessing remote memories cannot invoke activities at the target which complicates implementation and limits performance of data-centr
Externí odkaz:
http://arxiv.org/abs/1910.12897