483 citations · 1k across the 69 of their papers we have counts for
11 papers · 1 filter
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
Maciej Besta, Marc Fischer, Vasiliki Kalavri +2
Graph processing has become an important part of various areas of computing, including machine learning, medical applications, social network analysis, computational sciences, and…
Slim Fly: A Cost Effective Low-Diameter Network Topology
Maciej Besta, Torsten Hoefler
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 approxi…
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics
Maciej Besta, Simon Weber, Lukas Gianinazzi +4
We propose Slim Graph: the first programming model and framework for practical lossy graph compression that facilitates high-performance approximate graph processing, storage, and…
Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons
Maciej Besta, Raghavendra Kanakagiri, Harun Mustafa +4
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 area…
Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations
Maciej Besta, Torsten Hoefler
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…
Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries
Maciej Besta, Robert Gerstenberger, Emanuel Peter +5
Graph processing has become an important part of multiple areas of computer science, such as machine learning, computational sciences, medical applications, social network analysis…
Network-Accelerated Non-Contiguous Memory Transfers
Salvatore Di Girolamo, Konstantin Taranov, Andreas Kurth +7
Applications often communicate data that is non-contiguous in the send- or the receive-buffer, e.g., when exchanging a column of a matrix stored in row-major order. While non-conti…
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication
Grzegorz Kwasniewski, Marko Kabić, Maciej Besta +3
We propose COSMA: a parallel matrix-matrix multiplication algorithm that is near communication-optimal for all combinations of matrix dimensions, processor counts, and memory sizes…
FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short
Maciej Besta, Marcel Schneider, Karolina Cynk +5
We introduce FatPaths: a simple, generic, and robust routing architecture that enables state-of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performanc…
Graph Processing on FPGAs: Taxonomy, Survey, Challenges
Maciej Besta, Dimitri Stanojevic, Johannes De Fine Licht +2
Graph processing has become an important part of various areas, such as machine learning, computational sciences, medical applications, social network analysis, and many others. Va…
A Modular Benchmarking Infrastructure for High-Performance and Reproducible Deep Learning
Tal Ben-Nun, Maciej Besta, Simon Huber +3
We introduce Deep500: the first customizable benchmarking infrastructure that enables fair comparison of the plethora of deep learning frameworks, algorithms, libraries, and techni…