4 papers
Replication in Graph Partitioning and Scheduling Problems
Pál András Papp, Toni Böhnlein, A. N. Yzelman
The efficient parallel execution of complex computations requires balancing the workload across processors while minimizing the communication between them. This inherent trade-off…
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…
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…