Showing cs.DCShow all
2 papers · 1 filter
cs.DC2026
Studying the Effect of Schedule Preemption on Dynamic Task Graph Scheduling
Mohammadali Khodabandehlou, Jared Coleman, Niranjan Suri +1
Dynamic scheduling of task graphs is often addressed without revisiting prior task allocations, with a primary focus on minimizing makespan. We study controlled schedule preemption…
cs.DC2025
PISA: An Adversarial Approach To Comparing Task Graph Scheduling Algorithms
Jared Coleman, Bhaskar Krishnamachari
Scheduling a task graph representing an application over a heterogeneous network of computers is a fundamental problem in distributed computing. It is known to be not only NP-hard…