5 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.DC2024★ 5 cited
Efficient Multi-Processor Scheduling in Increasingly Realistic Models
Pál András Papp, Georg Anegg, Aikaterini Karanasiou +1
We study the problem of efficiently scheduling a computational DAG on multiple processors. The majority of previous works have developed and compared algorithms for this problem in…
cs.CC2023★ 2 cited
DAG Scheduling in the BSP Model
Pál András Papp, Georg Anegg, A. N. Yzelman
We study the problem of scheduling an arbitrary computational DAG on a fixed number of processors while minimizing the makespan. While previous works have mostly studied this probl…
cs.CC2022★ 5 cited
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
Pál András Papp, Georg Anegg, A. N. Yzelman
We study the balanced -way hypergraph partitioning problem, with a special focus on its practical applications to manycore scheduling. Given a hypergraph on nodes, our goal…