Jared Coleman

PISA: An Adversarial Approach To Comparing Task Graph Scheduling Algorithms

2024 · arXiv (Cornell University)

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 but also not polynomial-time approximable within a …