1 citations · 1 across the 2 of their papers we have counts for
4 papers
Symmetry-breaking symmetry in directed spectral partitioning
Dimosthenis Pasadakis, Raphael S. Steiner, Pál András Papp +2
We break the symmetry in classical spectral bi-partitioning in order to incentivise the alignment of directed cut edges. We use this to generate acyclic bi-partitions and furthermo…
Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions
Pál András Papp, Toni Böhnlein, A. N. Yzelman
We study the problem of scheduling a general computational DAG on multiple processors in a 2-level memory hierarchy. This setting is a natural generalization of several prominent m…
The Impact of Partial Computations on the Red-Blue Pebble Game
Pál András Papp, Aleksandros Sobczyk, A. N. Yzelman
We study an extension of the well-known red-blue pebble game (RBP) with partial computation steps, inspired by the recent work of Sobczyk. While the original RBP assumes that we ne…
Efficient Parallel Scheduling for Sparse Triangular Solvers
Toni Böhnlein, Pál András Papp, Raphael S. Steiner +2
We develop and analyze new scheduling algorithms for solving sparse triangular linear systems (SpTRSV) in parallel. Our approach produces highly efficient synchronous schedules for…