b'Maciej Besta'

research

∙ 08/23/2023

Cached Operator Reordering: A Unified View for Fast GNN Training

Graph Neural Networks (GNNs) are a powerful tool for handling structured...

0 Julia Bazinska, et al. ∙

research

∙ 08/18/2023

Graph of Thoughts: Solving Elaborate Problems with Large Language Models

We introduce Graph of Thoughts (GoT): a framework that advances promptin...

0 Maciej Besta, et al. ∙

research

∙ 05/18/2023

The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores

Graph databases (GDBs) are crucial in academic and industry applications...

0 Maciej Besta, et al. ∙

research

∙ 02/14/2023

PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks

In this paper, we present PolarStar, a novel family of diameter-3 networ...

0 Kartik Lakhotia, et al. ∙

research

∙ 11/25/2022

HexaMesh: Scaling to Hundreds of Chiplets with an Optimized Chiplet Arrangement

2.5D integration is an important technique to tackle the growing cost of...

0 Patrick Iff, et al. ∙

research

∙ 11/25/2022

Sparse Hamming Graph: A Customizable Network-on-Chip Topology

Chips with hundreds to thousands of cores require scalable networks-on-c...

0 Patrick Iff, et al. ∙

research

∙ 09/20/2022

Neural Graph Databases

Graph databases (GDBs) enable processing and analysis of unstructured, c...

65 Maciej Besta, et al. ∙

research

∙ 08/24/2022

ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations

Important graph mining problems such as Clustering are computationally d...

0 Maciej Besta, et al. ∙

research

∙ 08/02/2022

PolarFly: A Cost-Effective and Flexible Low-Diameter Topology

In this paper we present PolarFly, a diameter-2 network topology based o...

0 Kartik Lakhotia, et al. ∙

research

∙ 06/20/2022

Building Blocks for Network-Accelerated Distributed File Systems

High-performance clusters and datacenters pose increasingly demanding re...

0 Salvatore Di Girolamo, et al. ∙

research

∙ 05/19/2022

Parallel and Distributed Graph Neural Networks: An In-Depth Concurrency Analysis

Graph neural networks (GNNs) are among the most powerful tools in deep l...

92 Maciej Besta, et al. ∙

research

∙ 02/28/2022

Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching

Triangle count and local clustering coefficient are two core metrics for...

0 András Strausz, et al. ∙

research

∙ 09/20/2021

Parallel Algorithms for Finding Large Cliques in Sparse Graphs

We present a parallel k-clique listing algorithm with improved work boun...

0 Lukas Gianinazzi, et al. ∙

research

∙ 08/20/2021

On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal Matrix Factorizations

Matrix factorizations are among the most important building blocks of sc...

0 Grzegorz Kwasniewski, et al. ∙

research

∙ 05/26/2021

Towards Million-Server Network Simulations on Just a Laptop

The growing size of data center and HPC networks pose unprecedented requ...

0 Maciej Besta, et al. ∙

research

∙ 05/15/2021

Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs

Determining I/O lower bounds is a crucial step in obtaining communicatio...

0 Grzegorz Kwasniewski, et al. ∙

research

∙ 04/15/2021

SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems

Simple graph algorithms such as PageRank have been the target of numerou...

0 Maciej Besta, et al. ∙

research

∙ 03/05/2021

GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra

We propose GraphMineSuite (GMS): the first benchmarking suite for graph ...

28 Maciej Besta, et al. ∙

research

∙ 12/28/2020

SeBS: A Serverless Benchmark Suite for Function-as-a-Service Computing

Function-as-a-Service (FaaS) is one of the most promising directions for...

0 Marcin Copik, et al. ∙

research

∙ 12/11/2020

The Future is Big Graphs! A Community View on Graph Processing Systems

Graphs are by nature unifying abstractions that can leverage interconnec...

0 Sherif Sakr, et al. ∙

research

∙ 10/30/2020

To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations

We reduce the cost of communication and synchronization in graph process...

0 Maciej Besta, et al. ∙

research

∙ 10/29/2020

Log(Graph): A Near-Optimal High-Performance Graph Representation

Today's graphs used in domains such as machine learning or social networ...

0 Maciej Besta, et al. ∙

research

∙ 10/28/2020

Substream-Centric Maximum Matchings on FPGA

Developing high-performance and energy-efficient algorithms for maximum ...

0 Maciej Besta, et al. ∙

research

∙ 10/21/2020

Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy Efficiency and Scalability

Emerging chips with hundreds and thousands of cores require networks wit...

0 Maciej Besta, et al. ∙

research

∙ 10/19/2020

SlimSell: A Vectorizable Graph Representation for Breadth-First Search

Vectorization and GPUs will profoundly change graph processing. Traditio...

0 Maciej Besta, et al. ∙

research

∙ 10/19/2020

High-Performance Distributed RMA Locks

We propose a topology-aware distributed Reader-Writer lock that accelera...

0 Patrick Schmid, et al. ∙

research

∙ 10/19/2020

Evaluating the Cost of Atomic Operations on Modern Architectures

Atomic operations (atomics) such as Compare-and-Swap (CAS) or Fetch-and-...

0 Hermann Schweizer, et al. ∙

research

∙ 10/18/2020

Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages

We propose Atomic Active Messages (AAM), a mechanism that accelerates ir...

0 Maciej Besta, et al. ∙

research

∙ 10/18/2020

Fault Tolerance for Remote Memory Access Programming Models

Remote Memory Access (RMA) is an emerging mechanism for programming high...

0 Maciej Besta, et al. ∙

research

∙ 10/12/2020

On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal LU Factorization

Dense linear algebra kernels, such as linear solvers or tensor contracti...

0 Grzegorz Kwasniewski, et al. ∙

research

∙ 08/26/2020

High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality

We develop the first parallel graph coloring heuristics with strong theo...

0 Maciej Besta, et al. ∙

research

∙ 07/07/2020

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks

The recent line of research into topology design focuses on lowering net...

0 Maciej Besta, et al. ∙

research

∙ 01/21/2020

Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided

Modern interconnects offer remote direct memory access (RDMA) features. ...

0 Robert Gerstenberger, et al. ∙

research

∙ 12/29/2019

Practice of Streaming and Dynamic Graphs: Concepts, Models, Systems, and Parallelism

Graph processing has become an important part of various areas of comput...

0 Maciej Besta, et al. ∙

research

∙ 12/19/2019

Slim Fly: A Cost Effective Low-Diameter Network Topology

We introduce a high-performance cost-effective network topology called S...

0 Maciej Besta, et al. ∙

research

∙ 12/18/2019

Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics

We propose Slim Graph: the first programming model and framework for pra...

0 Maciej Besta, et al. ∙

research

∙ 11/11/2019

Communication-Efficient Jaccard Similarity for High-Performance Distributed Genome Comparisons

Jaccard Similarity index is an important measure of the overlap of two s...

0 Maciej Besta, et al. ∙

research

∙ 10/28/2019

Active Access: A Mechanism for High-Performance Distributed Data-Centric Computations

Remote memory access (RMA) is an emerging high-performance programming m...

0 Maciej Besta, et al. ∙

research

∙ 10/20/2019

Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries

Graph processing has become an important part of multiple areas of compu...

0 Maciej Besta, et al. ∙

research

∙ 08/26/2019

Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication

We propose COSMA: a parallel matrix-matrix multiplication algorithm that...

0 Grzegorz Kwasniewski, et al. ∙

research

∙ 08/22/2019

Network-Accelerated Non-Contiguous Memory Transfers

Applications often communicate data that is non-contiguous in the send- ...

0 Salvatore Di Girolamo, et al. ∙

research

∙ 06/26/2019

FatPaths: Routing in Supercomputers, Data Centers, and Clouds with Low-Diameter Networks when Shortest Paths Fall Short

We introduce FatPaths: a simple, generic, and robust routing architectur...

0 Maciej Besta, et al. ∙

research

∙ 02/25/2019

Graph Processing on FPGAs: Taxonomy, Survey, Challenges

Graph processing has become an important part of various areas, such as ...

0 Maciej Besta, et al. ∙

research

∙ 01/29/2019

A Modular Benchmarking Infrastructure for High-Performance and Reproducible Deep Learning

We introduce Deep500: the first customizable benchmarking infrastructure...

0 Tal Ben-Nun, et al. ∙

research

∙ 06/05/2018

Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations

Various graphs such as web or social networks may contain up to trillion...

0 Maciej Besta, et al. ∙

research

∙ 09/22/2016

Scaling betweenness centrality using communication-efficient sparse matrix multiplication

Betweenness centrality (BC) is a crucial graph problem that measures the...

0 Edgar Solomonik, et al. ∙

Maciej Besta

Featured Co-authors