research-article

p-YDS algorithm: an optimal extension of YDS algorithm to minimize expected energy for real-time jobs

Authors:

Pratyush Kumar,

Lothar ThieleAuthors Info & Claims

EMSOFT '14: Proceedings of the 14th International Conference on Embedded Software

Article No.: 12, Pages 1 - 10

https://doi.org/10.1145/2656045.2656065

Published: 12 October 2014 Publication History

Get Access

Abstract

The YDS algorithm computes a schedule on a DVS-enabled resource to meet deadlines of all jobs and optimally minimize the total energy consumption. The algorithm requires that an exact execution time of each job be known. For settings where execution times are variable or uncertain, stochastic scheduling has been proposed to preferentially accelerate less probable phases of jobs to reduce the expected energy consumption. However, an analogue to the YDS algorithm for the stochastic setting has not been optimally solved. In this paper, we propose the p-YDS algorithm to minimize the expected energy consumption for a set of jobs with arbitrary arrival times, deadlines, and execution times. We then derive the competitive ratio of the YDS algorithm w.r.t. the p-YDS algorithm, for the metric of expected energy consumption. By comparing two optimal algorithms, this ratio specifies the worst-case energy cost of being agnostic to the variability in the execution time of jobs.

References

[1]

F. F. Yao, A. J. Demers, and S. Shenker, "A scheduling model for reduced cpu energy," in FOCS, pp. 374--382, IEEE Computer Society, 1995.

Digital Library

Google Scholar

[2]

N. Bansal and K. Pruhs, "Speed scaling to manage temperature," in STACS 2005, pp. 460--471, Springer, 2005.

Digital Library

Google Scholar

[3]

W. Yuan and K. Nahrstedt, "Energy-efficient soft real-time cpu scheduling for mobile multimedia systems," in Proceedings of the nineteenth ACM symposium on Operating systems principles, SOSP '03, (New York, NY, USA), pp. 149--163, ACM, 2003.

Digital Library

Google Scholar

[4]

C. Xian, Y.-H. Lu, and Z. Li, "Dynamic voltage scaling for multitasking real-time systems with uncertain execution time," IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 27, no. 8, pp. 1467--1478, 2008.

Digital Library

Google Scholar

[5]

J. R. Lorch and A. J. Smith, "Improving dynamic voltage scaling algorithms with pace," in SIGMETRICS/Performance, pp. 50--61, ACM, 2001.

Digital Library

Google Scholar

[6]

J. E. Fritts, F. W. Steiling, and J. A. Tucek, "Mediabench ii video: Expediting the next generation of video systems research," in Electronic Imaging 2005, pp. 79--93, International Society for Optics and Photonics, 2005.

Google Scholar

[7]

D. Mosse, H. Aydin, B. Childers, and R. Melhem, "Compiler-assisted dynamic power-aware scheduling for real-time applications," in In Workshop on Compilers and Operating Systems for Low Power, 2000.

Google Scholar

[8]

F. Gruian, "Hard real-time scheduling for low-energy using stochastic data and dvs processors," in ISLPED (E. Macii, V. De, and M. J. Irwin, eds.), pp. 46--51, ACM, 2001.

Digital Library

Google Scholar

[9]

R. Xu, D. Mossé, and R. G. Melhem, "Minimizing expected energy in real-time embedded systems," in EMSOFT (W. Wolf, ed.), pp. 251--254, ACM, 2005.

Digital Library

Google Scholar

[10]

R. Xu, R. Melhem, and D. Mossé, "A unified practical approach to stochastic dvs scheduling," in Proceedings of the 7th ACM & IEEE international conference on Embedded software, pp. 37--46, ACM, 2007.

Digital Library

Google Scholar

[11]

J.-J. Chen and L. Thiele, "Expected system energy consumption minimization in leakage-aware dvs systems," in ISLPED, pp. 315--320, ACM, 2008.

Digital Library

Google Scholar

[12]

P. Pillai and K. G. Shin, "Real-time dynamic voltage scaling for low-power embedded operating systems," in ACM SIGOPS Operating Systems Review, vol. 35, pp. 89--102, ACM, 2001.

Digital Library

Google Scholar

[13]

S. Saewong and R. Rajkumar, "Practical voltage-scaling for fixed-priority rt-systems," in Real-Time and Embedded Technology and Applications Symposium, 2003. Proceedings. The 9th IEEE, pp. 106--114, IEEE, 2003.

Digital Library

Google Scholar

[14]

P. Kumar and L. Thiele, "p-yds algorithm: An optimal extension of yds algorithm to minimize expected energy for real-time jobs," Tech. Rep. TIK No. 353, TIK, ETH Zurich, 2014. Available at ftp://ftp.tik.ee.ethz.ch/pub/publications/TIK-Report-353.pdf.

Digital Library

Google Scholar

Cited By

View all

Imes CZhang HZhao KHoffmann H(2019)CoPPer: Soft Real-Time Application Performance Using Hardware Power Capping2019 IEEE International Conference on Autonomic Computing (ICAC)10.1109/ICAC.2019.00015(31-41)Online publication date: Jul-2019
https://doi.org/10.1109/ICAC.2019.00015
Castelli MGonçalves ITrujillo LPopoviăź A(2018)An evolutionary system for ozone concentration forecastingInformation Systems Frontiers10.1007/s10796-016-9706-219:5(1123-1132)Online publication date: 24-Dec-2018
https://dl.acm.org/doi/10.1007/s10796-016-9706-2
Nelson AGoossens KGirault AGuan N(2015)Distributed power management of real-time applications on a GALS multiprocessor SOCProceedings of the 12th International Conference on Embedded Software10.5555/2830865.2830882(147-156)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.5555/2830865.2830882
Show More Cited By

Index Terms

Recommendations

Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness

This paper studies the Pareto optimization scheduling problem of family jobs on an unbounded parallel-batching machine to minimize makespan and maximum lateness. In the problem, the jobs are partitioned into families and scheduled in batches, where each ...
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06: Proceedings of the 27th IEEE International Real-Time Systems Symposium

We present an optimal real-time scheduling algorithm for multiprocessors -- one that satisfies all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. The algorithm called LLREF, is designed ...

Comments

Information & Contributors

Information

Published In

EMSOFT '14: Proceedings of the 14th International Conference on Embedded Software

October 2014

301 pages

ISBN:9781450330527

DOI:10.1145/2656045

Program Chairs:
Tulika Mitra
National University of Singapore, Singapore
,
Jan Reineke
Saarland University, Germany

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 October 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Nano-Tera.ch with Swiss Confederation financing

Conference

ESWEEK'14

Sponsor:

ESWEEK'14: TENTH EMBEDDED SYSTEM WEEK

October 12 - 17, 2014

New Delhi, India

Acceptance Rates

Overall Acceptance Rate 60 of 203 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
126
Total Downloads

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

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Imes CZhang HZhao KHoffmann H(2019)CoPPer: Soft Real-Time Application Performance Using Hardware Power Capping2019 IEEE International Conference on Autonomic Computing (ICAC)10.1109/ICAC.2019.00015(31-41)Online publication date: Jul-2019
https://doi.org/10.1109/ICAC.2019.00015
Castelli MGonçalves ITrujillo LPopoviăź A(2018)An evolutionary system for ozone concentration forecastingInformation Systems Frontiers10.1007/s10796-016-9706-219:5(1123-1132)Online publication date: 24-Dec-2018
https://dl.acm.org/doi/10.1007/s10796-016-9706-2
Nelson AGoossens KGirault AGuan N(2015)Distributed power management of real-time applications on a GALS multiprocessor SOCProceedings of the 12th International Conference on Embedded Software10.5555/2830865.2830882(147-156)Online publication date: 4-Oct-2015
https://dl.acm.org/doi/10.5555/2830865.2830882
Nelson AGoossens K(2015)Distributed power management of real-time applications on a GALS multiprocessor SOC2015 International Conference on Embedded Software (EMSOFT)10.1109/EMSOFT.2015.7318270(147-156)Online publication date: Oct-2015
https://doi.org/10.1109/EMSOFT.2015.7318270

View Options

Login options

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

Cited By

Index Terms

Recommendations

Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness

Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

An Optimal Real-Time Scheduling Algorithm for Multiprocessors