Article

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

Author:

Philippe BaptisteAuthors Info & Claims

SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Pages 364 - 367

Published: 22 January 2006 Publication History

Get Access

Abstract

Power Management policies aim at reducing the amount of energy consumed by battery operated systems, while keeping the overall performance high. In this paper we focus on shut-down mechanisms that put a system into a sleep state when it is idle. A very small amount of energy is consumed in this state but, a fixed amount of energy is required when moving the system from the sleep state to the active state. The offline version of this problem consists in scheduling a set of unit execution tasks, with release dates and deadlines, on a single machine in order to minimize the number of idle time periods. We show that this problem can be solved in polynomial time by Dynamic Programming.

References

[1]

Philippe Baptiste. Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103, 2000.

Digital Library

Google Scholar

[2]

Philippe Chretienne. On the no-wait single machine scheduling problem. In Proceeding of the 7th Conference on Models and Algorithms for Planning and Scheduling, pages 76--79, June 2005.

Google Scholar

[3]

Sandy Irani and Anna Karlin. Approximation Algorithms for NP-complete Problems, chapter Online Computation, pages 521--559. PWS Publishing Company, 1997.

Digital Library

Google Scholar

[4]

Sandy Irani and Kirk Pruhs. Algorithmic problems in power management. volume 36, pages 63--76, New York, NY, USA, 2005. ACM Press.

Digital Library

Google Scholar

[5]

Sandy Irani, Sandeep Shukla, and Rajesh Gupta. Algorithms for power savings. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 37--46, 2003.

Digital Library

Google Scholar

Cited By

View all

Antoniadis AHuang COtt SIndyk P(2015)A fully polynomial-time approximation scheme for speed scaling with sleep stateProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722203(1102-1113)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722203
Fineman JSheridan BBlelloch GAgrawal K(2015)Scheduling Non-Unit Jobs to Minimize CalibrationsProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755605(161-170)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2755573.2755605
Chrobak MGolin MLam TNogneng D(2015)Scheduling with GapsProceedings of the 9th International Conference on Algorithms and Complexity - Volume 907910.1007/978-3-319-18173-8_8(114-126)Online publication date: 20-May-2015
https://dl.acm.org/doi/10.1007/978-3-319-18173-8_8
Show More Cited By

Index Terms

Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management
1. Computing methodologies
  1. Artificial intelligence
    1. Planning and scheduling
2. Theory of computation
  1. Design and analysis of algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

Scheduling a Single Machine to Minimize the Number of Late Jobs
On Non-preemptive Scheduling of Recurring Tasks Using Inserted Idle Times

We consider the problem of non-preemptively scheduling periodic and sporadic task systems on one processor using inserted idle times. For periodic task systems, we prove that the decision problem of determining whether a periodic task system is ...
Scheduling Multiprocessor Tasks to Minimize Schedule Length

The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for ...

Comments

Information & Contributors

Information

Published In

SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

January 2006

1261 pages

ISBN:0898716055

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 22 January 2006

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
767
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)1

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Antoniadis AHuang COtt SIndyk P(2015)A fully polynomial-time approximation scheme for speed scaling with sleep stateProceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms10.5555/2722129.2722203(1102-1113)Online publication date: 4-Jan-2015
https://dl.acm.org/doi/10.5555/2722129.2722203
Fineman JSheridan BBlelloch GAgrawal K(2015)Scheduling Non-Unit Jobs to Minimize CalibrationsProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755605(161-170)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2755573.2755605
Chrobak MGolin MLam TNogneng D(2015)Scheduling with GapsProceedings of the 9th International Conference on Algorithms and Complexity - Volume 907910.1007/978-3-319-18173-8_8(114-126)Online publication date: 20-May-2015
https://dl.acm.org/doi/10.1007/978-3-319-18173-8_8
Chang JKhuller SMukherjee KBlelloch GSanders P(2014)LP rounding and combinatorial algorithms for minimizing active and busy timeProceedings of the 26th ACM symposium on Parallelism in algorithms and architectures10.1145/2612669.2612689(118-127)Online publication date: 23-Jun-2014
https://dl.acm.org/doi/10.1145/2612669.2612689
Albers SAntoniadis A(2014)Race to idleACM Transactions on Algorithms10.1145/255695310:2(1-31)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1145/2556953
Angel EBampis EChau V(2014)Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlinesDiscrete Applied Mathematics10.1016/j.dam.2014.05.023175(1-10)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1016/j.dam.2014.05.023
Awan MYomsi PPetters SAuguin Mde Simone RDavis RGrolleau E(2013)Optimal procrastination interval for constrained deadline sporadic tasks upon uniprocessorsProceedings of the 21st International conference on Real-Time Networks and Systems10.1145/2516821.2516837(129-138)Online publication date: 16-Oct-2013
https://dl.acm.org/doi/10.1145/2516821.2516837
Bender MBunde DLeung VMcCauley SPhillips CBlelloch GVöcking B(2013)Efficient scheduling to minimize calibrationsProceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures10.1145/2486159.2486193(280-287)Online publication date: 23-Jul-2013
https://dl.acm.org/doi/10.1145/2486159.2486193
Albers SAntoniadis A(2012)Race to idleProceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms10.5555/2095116.2095216(1266-1285)Online publication date: 17-Jan-2012
https://dl.acm.org/doi/10.5555/2095116.2095216
Baptiste PChrobak MDürr C(2012)Polynomial-time algorithms for minimum energy schedulingACM Transactions on Algorithms10.1145/2229163.22291708:3(1-29)Online publication date: 24-Jul-2012
https://dl.acm.org/doi/10.1145/2229163.2229170
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Scheduling a Single Machine to Minimize the Number of Late Jobs

On Non-preemptive Scheduling of Recurring Tasks Using Inserted Idle Times

Scheduling Multiprocessor Tasks to Minimize Schedule Length

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations