activity
20192021
collaborators

5 papers

cs.AR2021

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

Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski +15

Simple graph algorithms such as PageRank have been the target of numerous hardware accelerators. Yet, there also exist much more complex graph mining algorithms for problems such a…

cs.DC2020

Runtime vs Scheduler: Analyzing Dask's Overheads

Stanislav Böhm, Jakub Beránek

Dask is a distributed task framework which is commonly used by data scientists to parallelize Python code on computing clusters with little programming effort. It uses a sophistica…

cs.FL2019

Haydi: Rapid Prototyping and Combinatorial Objects

Stanislav Böhm, Jakub Beránek, Martin Šurkovský

Haydi (http://haydi.readthedocs.io) is a framework for generating discrete structures. It provides a way to define a structure from basic building blocks and then enumerate all ele…

cs.DC2019

Streaming Message Interface: High-Performance Distributed Memory Programming on Reconfigurable Hardware

Tiziano De Matteis, Johannes de Fine Licht, Jakub Beránek +1

Distributed memory programming is the established paradigm used in high-performance computing (HPC) systems, requiring explicit communication between nodes and devices. When FPGAs…

cs.NI2019

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…