Scheduling large jobs by abstraction refinement

Thomas A. Henzinger, Vasu Singh, Thomas Wies, Damien Zufferey · 2011

The static scheduling problem often arises as a fundamental problem in real-time systems and grid computing. We consider the problem of statically scheduling a large job expressed as a task graph on a large number of computing nodes, such as a data center.

Read the paper · More papers on PaperTik