2 papers
cs.CC2024
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.DC2024
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…