Speed scaling with power down scheduling for agreeable deadlines

TL;DR

This paper presents an efficient algorithm for energy-aware scheduling of jobs with agreeable deadlines on a single processor that can vary speed and hibernate, ensuring flow time guarantees.

Contribution

It introduces an O(n^3) algorithm for scheduling jobs with agreeable deadlines, balancing energy efficiency and quality of service.

Findings

Algorithm efficiently schedules jobs with agreeable deadlines

Guarantees flow time constraints while minimizing energy

Applicable to systems with variable speed and power down features

Abstract

We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload w_j and a release time r_j. The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing overall consumed energy, it might be that some jobs complete arbitrarily far from their release time. So in order to guarantee some quality of service, we would like to impose a deadline d_j=r_j+F for every job j, where F is a guarantee on the *flow time*. We provide an O(n^3) algorithm for the more general case of *agreeable deadlines*, where jobs have release times and deadlines and can be ordered such that for every i<j, both r_i<=r_j and d_i<=d_j.