Scheduling on Two Types of Resources: a Survey

TL;DR

This survey reviews and classifies scheduling algorithms for modern heterogeneous parallel platforms, providing unified implementations and benchmarks to compare their efficiency and understand the challenges posed by resource heterogeneity.

Contribution

It offers a comprehensive classification of scheduling algorithms, unified benchmarking tools, and insights into the main difficulties of scheduling on heterogeneous resources.

Findings

Unified benchmarks enable fair comparison of algorithms.

Heterogeneity introduces significant scheduling challenges.

Shared principles guide the design of efficient scheduling algorithms.

Abstract

The evolution in the design of modern parallel platforms leads to revisit the scheduling jobs on distributed heterogeneous resources. The goal of this survey is to present the main existing algorithms, to classify them based on their underlying principles and to propose unified implementations to enable their fair comparison, both in terms of running time and quality of schedules, on a large set of common benchmarks that we made available for the community. Beyond this comparison, our goal is also to understand the main difficulties that heterogeneity conveys and the shared principles that guide the design of efficient algorithms.