75 citations · 77 across the 10 of their papers we have counts for
3 papers · 1 filter
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…
Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components
Jared Coleman, Ravi Vivek Agrawal, Ebrahim Hirani +1
Scheduling distributed applications modeled as directed, acyclic task graphs to run on heterogeneous compute networks is a fundamental (NP-Hard) problem in distributed computing fo…
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…