# Slow Down & Sleep for Profit in Online Deadline Scheduling

@article{Kling2012SlowD, title={Slow Down \& Sleep for Profit in Online Deadline Scheduling}, author={Peter Kling and Andreas Cord-Landwehr and Frederik Mallmann-Trenn}, journal={ArXiv}, year={2012}, volume={abs/1209.2848} }

We present and study a new model for energy-aware and profit-oriented scheduling on a single processor. The processor features dynamic speed scaling as well as suspension to a sleep mode. Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines. On the arrival of a new job, the scheduler may either accept or reject the job. Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values. Here, power…

## 2 Citations

### Slow Down and Sleep for Profit in Online Deadline Scheduling

- Computer ScienceMedAlg
- 2012

It turns out that the worst-case performance of such schedulers depends linearly on the jobs' value densities (the ratio between a job's value and its work), and is given an algorithm whose competitiveness nearly matches this lower bound.

### On-The-Fly Computing: A novel paradigm for individualized IT services

- Computer Science16th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing (ISORC 2013)
- 2013

This paper introduces “On-The-Fly Computing”, a vision of future IT services that will be provided by assembling modular software components available on world-wide markets and points out three research challenges and the current work in these areas.

## References

SHOWING 1-10 OF 15 REFERENCES

### Race to idle: New algorithms for speed scaling with a sleep state

- Computer ScienceTALG
- 2014

An energy conservation problem where a variable-speed processor is equipped with a sleep state and the NP-hardness of the optimization problem is proved, and an algorithmic framework for designing good approximation algorithms is presented.

### Tradeoff between Energy and Throughput for Online Deadline Scheduling

- Computer ScienceWAOA
- 2010

This work considers dynamic speed scaling on a single processor and study the tradeoff between throughput and energy for deadline scheduling, and gives new online algorithms under both the unbounded-speed and bounded-speed models.

### Deadline scheduling and power management for speed bounded processors

- Computer ScienceTheor. Comput. Sci.
- 2010

### Polynomial-time algorithms for minimum energy scheduling

- Computer ScienceTALG
- 2012

The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining a satisfactory level of performance, and it has been an open problem whether a schedule minimizing the overall energy consumption can be computed in polynomial time.

### Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management

- Computer ScienceSODA '06
- 2006

This paper focuses on shut-down mechanisms that put a system into a sleep state when it is idle and shows that this problem can be solved in polynomial time by Dynamic Programming.

### Energy efficient online deadline scheduling

- Computer ScienceSODA '07
- 2007

This paper presents the first online algorithm for the more realistic setting where processor speed is bounded and the system may be overloaded; the algorithm is O(1)-competitive on both throughput and energy usage.

### A scheduling model for reduced CPU energy

- Computer ScienceProceedings of IEEE 36th Annual Foundations of Computer Science
- 1995

This paper proposes a simple model of job scheduling aimed at capturing some key aspects of energy minimization, and gives an off-line algorithm that computes, for any set of jobs, a minimum-energy schedule.

### Speed scaling to manage energy and temperature

- Computer ScienceJACM
- 2007

The study of speed scaling to manage temperature is initiated and it is shown that the optimal temperature schedule can be computed offline in polynomial-time using the Ellipsoid algorithm and that no deterministic online algorithm can have a better competitive ratio.

### How to Schedule When You Have to Buy Your Energy

- Computer ScienceAPPROX-RANDOM
- 2010

A (1+e)-speed O(1)-competitive algorithm is given, and it is shown that resource augmentation is necessary to achieve O( 1)-competitiveness.

### Scheduling for Speed Bounded Processors

- Computer ScienceICALP
- 2008

The throughput guarantee is optimal as any online algorithm must be at least 4-competitive even if the energy concern is ignored, and the trade-off between the total flow time incurred and the energy consumed by the jobs is considered.