Exploring the throughput-fairness tradeoff of deadline scheduling in heterogeneous computing environments

Abstract

The scalability and computing power of large-scale computational platforms has made them attractive for hosting compute-intensive time-critical applications. Many of these applications are composed of computational tasks that require specific deadlines to be met for successful completion. In this paper, we show that combining redundant scheduling with deadline-based scheduling in these systems leads to a fundamental tradeoff between throughput and fairness. We propose a new scheduling algorithm called Limited Resource Earliest Deadline (LRED) that couples redundant scheduling with deadline-driven scheduling in a flexible way by using a simple tunable parameter to exploit this tradeoff. Our evaluation of LRED shows that LRED provides a powerful mechanism to achieve desired throughput or fairness under high loads and low timeliness environments.

Related Papers

• → A Game Theoretical Formulation for Proportional Fairness in LTE Uplink Scheduling(2009)67 cited
• → Delay-Based Weighted Proportional Fair Algorithm for LTE Downlink Packet Scheduling(2015)16 cited
• → Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors(2015)12 cited
• → Proportional equal throughput scheduler — A very fair scheduling approach in LTE downlink(2014)9 cited
• → Task scheduling in time-triggered real-time systems(2014)