Scheduling on Two Types of Resources: a Survey

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.

References in corpus (2)

• Scheduling Unrelated Machines of Few Different Types
• Scheduling data flow program in xkaapi: A new affinity based Algorithm for Heterogeneous Architectures

Cited by in corpus (4)

• DeepSoCS: A Neural Scheduler for Heterogeneous System-on-Chip (SoC) Resource Scheduling
• Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems
• New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines
• Cost models for geo-distributed massively parallel streaming analytics