483 citations · 3k across the 177 of their papers we have counts for
33 papers · 1 filter
Extracting Clean Performance Models from Tainted Programs
Marcin Copik, Alexandru Calotoiu, Tobias Grosser +3
Performance models are well-known instruments to understand the scaling behavior of parallel applications. They express how performance changes as key execution parameters, such as…
Indirection Stream Semantic Register Architecture for Efficient Sparse-Dense Linear Algebra
Paul Scheffler, Florian Zaruba, Fabian Schuiki +2
Sparse-dense linear algebra is crucial in many domains, but challenging to handle efficiently on CPUs, GPUs, and accelerators alike; multiplications with sparse formats like CSR an…
SeBS: A Serverless Benchmark Suite for Function-as-a-Service Computing
Marcin Copik, Grzegorz Kwasniewski, Maciej Besta +2
Function-as-a-Service (FaaS) is one of the most promising directions for the future of cloud services, and serverless functions have immediately become a new middleware for buildin…
Deep Data Flow Analysis
Chris Cummins, Hugh Leather, Zacharias Fisches +3
Compiler architects increasingly look to machine learning when building heuristics for compiler optimization. The promise of automatic heuristic design, freeing the compiler engine…
Parametric Graph Templates: Properties and Algorithms
Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler +1
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, w…
To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations
Maciej Besta, Michal Podstawski, Linus Groner +2
We reduce the cost of communication and synchronization in graph processing by analyzing the fastest way to process graphs: pushing the updates to a shared state or pulling the upd…
Log(Graph): A Near-Optimal High-Performance Graph Representation
Maciej Besta, Dimitri Stanojevic, Tijana Zivic +3
Today's graphs used in domains such as machine learning or social network analysis may contain hundreds of billions of edges. Yet, they are not necessarily stored efficiently, and…
Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages
Maciej Besta, Torsten Hoefler
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…
Substream-Centric Maximum Matchings on FPGA
Maciej Besta, Marc Fischer, Tal Ben-Nun +3
Developing high-performance and energy-efficient algorithms for maximum matchings is becoming increasingly important in social network analysis, computational sciences, scheduling,…
Work-stealing prefix scan: Addressing load imbalance in large-scale image registration
Marcin Copik, Tobias Grosser, Torsten Hoefler +2
Parallelism patterns (e.g., map or reduce) have proven to be effective tools for parallelizing high-performance applications. In this paper, we study the recursive registration of…
High-Performance Distributed RMA Locks
Patrick Schmid, Maciej Besta, Torsten Hoefler
We propose a topology-aware distributed Reader-Writer lock that accelerates irregular workloads for supercomputers and data centers. The core idea behind the lock is a modular desi…
MigrOS: Transparent Operating Systems Live Migration Support for Containerised RDMA-applications
Maksym Planeta, Jan Bierbaum, Leo Sahaya Daphne Antony +2
Major data centre providers are introducing RDMA-based networks for their tenants, as well as for operating the underlying infrastructure. In comparison to traditional socket-based…
Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy Efficiency and Scalability
Maciej Besta, Syed Minhaj Hassan, Sudhakar Yalamanchili +3
Emerging chips with hundreds and thousands of cores require networks with unprecedented energy/area efficiency and scalability. To address this, we propose Slim NoC (SN): a new on-…
SlimSell: A Vectorizable Graph Representation for Breadth-First Search
Maciej Besta, Florian Marending, Edgar Solomonik +1
Vectorization and GPUs will profoundly change graph processing. Traditional graph algorithms tuned for 32- or 64-bit based memory accesses will be inefficient on architectures with…
Evaluating the Cost of Atomic Operations on Modern Architectures
Hermann Schweizer, Maciej Besta, Torsten Hoefler
Atomic operations (atomics) such as Compare-and-Swap (CAS) or Fetch-and-Add (FAA) are ubiquitous in parallel programming. Yet, performance tradeoffs between these operations and va…
Fault Tolerance for Remote Memory Access Programming Models
Maciej Besta, Torsten Hoefler
Remote Memory Access (RMA) is an emerging mechanism for programming high-performance computers and datacenters. However, little work exists on resilience schemes for RMA-based appl…
On the Parallel I/O Optimality of Linear Algebra Kernels: Near-Optimal LU Factorization
Grzegorz Kwasniewski, Tal Ben-Nun, Alexandros Nikolaos Ziogas +3
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…
StencilFlow: Mapping Large Stencil Programs to Distributed Spatial Computing Systems
Johannes de Fine Licht, Andreas Kuster, Tiziano De Matteis +3
Spatial computing devices have been shown to significantly accelerate stencil computations, but have so far relied on unrolling the iterative dimension of a single stencil operatio…
PsPIN: A high-performance low-power architecture for flexible in-network compute
Salvatore Di Girolamo, Andreas Kurth, Alexandru Calotoiu +5
The capacity of offloading data and control tasks to the network is becoming increasingly important, especially if we consider the faster growth of network speed when compared to C…
ScalAna: Automating Scaling Loss Detection with Graph Analysis
Yuyang Jin, Haojie Wang, Teng Yu +4
Scaling a parallel program to modern supercomputers is challenging due to inter-process communication, Amdahl's law, and resource contention. Performance analysis tools for finding…
An In-Depth Analysis of the Slingshot Interconnect
Daniele De Sensi, Salvatore Di Girolamo, Kim H. McMahon +2
The interconnect is one of the most critical components in large scale computing systems, and its impact on the performance of applications is going to increase with the system siz…
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
Maciej Besta, Armon Carigiet, Zur Vonarburg-Shmaria +3
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 ver…
Parallel Planar Subgraph Isomorphism and Vertex Connectivity
Lukas Gianinazzi, Torsten Hoefler
We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bou…
High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks
Maciej Besta, Jens Domke, Marcel Schneider +5
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, po…