5 citations · 11 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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…