Learning scheduling algorithms for data processing clusters

Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems use simple, generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each workload is infeasible. In this paper, we show that modern machine learning techniques can generate highly-efficient policies automatically.

• NS
  National Science Foundation

  Awards: 1751009, CNS-1751009, 1617702
• CS
  Cisco Systems