skip to main content
article

Shortest-path algorithms for real-time scheduling of FIFO tasks with minimal energy use

Published: 01 November 2005 Publication History

Abstract

We present an algorithm for scheduling a set of nonrecurrent tasks (or jobs) with FIFO real-time constraints so as to minimize the total energy consumed when the tasks are performed on a dynamically variable voltage processor. Our algorithm runs in linear time and thus, in this case, is an improvement over the classical algorithm of Yao et al. It was inspired by considering the problem as a shortest-path problem. We also propose an algorithm to deal with the case where the processor has only a limited number of clock frequencies. This algorithm gives the optimum schedule with the minimum number of speed changes, which is important when the speed switching overhead cannot be neglected. All our algorithms are linear in the number of tasks if the arrivals and deadlines are sorted and otherwise need O(N log N) time. These complexities are shown to be the best possible. Finally, we extend our results to fluid tasks and to nonconvex cost functions.

References

[1]
Aydin, H., R., M., Mossè, D., and P., M.-A. 2001. Dynamic and agressive scheduling techniques for power aware real-time systems. In Real-Time Systems Symposium. 95--105.
[2]
Boissonnat, J. and Yvinec, M. 1995. Géométrie Algorithmique. Ediscience International.
[3]
Es Salhiene, M., Fesquet, L., and Renaudin, M. 2003. Adaptation dynamique de la puissance des systèmes embarqués: les systèmes asynchrones surclassent les systèmes synchrones. In journées d'études Faible Tension---Faible Consommation (FTFC'03). 51--58.
[4]
Gruian, F. 2001. On energy reduction in hard real-time systems containing tasks with stochastic execution times. In IEEE Workshop on Power Management for Real-Time and Embedded Systems. 11--16.
[5]
Gruian, F. 2002. Energy-centric scheduling for real-time systems. Ph.D. thesis, Lund Institute of Technology, Sweden.
[6]
Hong, I., Potkonjak, M., and Srivastava, M. 1998. On-line scheduling of hard real-time tasks on variable voltage processor. In International Conference on Computer Design. 653--656.
[7]
Ishihara, T. and Yasuura, H. 1998. Voltage scheduling problem for dynamically variable voltage processors. In International Symposium on Low Power Electronics and Design. 197--202.
[8]
Jackson, J. 1955. Scheduling a production line to minimize maximum tardiness. Tech. Rept., University of California. Report 43.
[9]
Lorch, J. and Smith, A. 2001. Improving dynamic voltage scaling algorithms with pace. In ACM SIGMETRICS 2001 Conference. 50--61.
[10]
Mossè, D., Aydin, H., Childers, B., and Melhem, R. 2000. Compiler-assisted dynamic power-aware scheduling for real-time applications. In Workshop on Compiler and Operating Systems for Low-Power.
[11]
Quan, G. and Hu, X. 2001. Energy efficient fixed-priority scheduling for real-time systems on variable voltage processors. In Design Automation Conference. 828--833.
[12]
Shin, D., Kim, J., and Lee, S. 2001. Intra-task voltage scheduling for low-energy hard real-time applications. IEEE Design & Test of Computers 18, 2, 20--30.
[13]
Shin, Y. and Choi, K. 1999. Power conscious fixed priority scheduling for hard real-time systems. In Design Automation Conference. 134--139.
[14]
Stankovic, J., Spuri, M., Ramamritham, K., and Buttazo, G. 1998. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms. Kluwer Academic Publ. Boston, MA.
[15]
Yao, F. 2003. Complexity of the Yao Demers Shenker algorithm. Private communication.
[16]
Yao, F., Demers, A., and Shenker, S. 1995. A scheduling model for reduced CPU energy. In Proceedings of lEEE Annual Foundations of Computer Science. 374--382.
[17]
Yun, H.-S. and Kim, J. 2003. On energy-optimal voltage scheduling for fixed-priority hard real-time systems. ACM Transactions on Embedded Computing Systems 2, 3 (Aug.), 393--430.
[18]
Zhang, F. and Chanson, S. 2002. Processor voltage scheduling for real-time tasks with non-preemptible sections. In Real-Time Systems Symposium. 235--245.

Cited By

View all
  • (2021)Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and AlgorithmsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/34910495:3(1-37)Online publication date: 15-Dec-2021
  • (2020)A Dynamic Neural Network for Solving Time-varying Shortest Path with Hop-constraintJournal of Physics: Conference Series10.1088/1742-6596/1693/1/0121561693(012156)Online publication date: 17-Dec-2020
  • (2020)Dynamic speed scaling minimizing expected energy consumption for real-time tasksJournal of Scheduling10.1007/s10951-020-00660-923:5(555-574)Online publication date: 1-Oct-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems
ACM Transactions on Embedded Computing Systems  Volume 4, Issue 4
November 2005
259 pages
ISSN:1539-9087
EISSN:1558-3465
DOI:10.1145/1113830
Issue’s Table of Contents
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

Journal Family

Publication History

Published: 01 November 2005
Published in TECS Volume 4, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Real-time systems
  2. low-power design
  3. scheduling
  4. voltage scaling

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)3
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and AlgorithmsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/34910495:3(1-37)Online publication date: 15-Dec-2021
  • (2020)A Dynamic Neural Network for Solving Time-varying Shortest Path with Hop-constraintJournal of Physics: Conference Series10.1088/1742-6596/1693/1/0121561693(012156)Online publication date: 17-Dec-2020
  • (2020)Dynamic speed scaling minimizing expected energy consumption for real-time tasksJournal of Scheduling10.1007/s10951-020-00660-923:5(555-574)Online publication date: 1-Oct-2020
  • (2018)Resource Allocation Under Sequential Resource AccessIEEE Transactions on Communications10.1109/TCOMM.2018.284665766:11(5608-5620)Online publication date: Nov-2018
  • (2018)Energy-Efficient Strategy for Placement of Online Services on Dynamic Availability Resources in Volunteer Cloud2018 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications (ISPA/IUCC/BDCloud/SocialCom/SustainCom)10.1109/BDCloud.2018.00097(629-636)Online publication date: Dec-2018
  • (2018)Resource Allocation under Sequential Resource Access: Theory and Application2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2018.8636038(767-773)Online publication date: 2-Oct-2018
  • (2018)On Optimization of Energy Consumption in a Volunteer CloudAlgorithms and Architectures for Parallel Processing10.1007/978-3-030-05054-2_31(388-398)Online publication date: 7-Dec-2018
  • (2016)Algorithmic Issues in Energy-Efficient ComputationDiscrete Optimization and Operations Research10.1007/978-3-319-44914-2_1(3-14)Online publication date: 10-Sep-2016
  • (2015)Non-preemptive Throughput Maximization for Speed-Scaling with Power-DownEuro-Par 2015: Parallel Processing10.1007/978-3-662-48096-0_14(171-182)Online publication date: 25-Jul-2015
  • (2013)Large Graph Mining: Recent Developments, Challenges and Potential SolutionsBusiness Intelligence10.1007/978-3-642-36318-4_5(103-124)Online publication date: 2013
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media