skip to main content
10.1145/1516241.1516330acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

Peak power control algorithm for multi-processor SoC

Published: 15 February 2009 Publication History

Abstract

The present study proposes subtask scheduling for lowering average power and preventing peak power violation in multi-core structure. The proposed algorithm is composed of the partitioning step that divides a task into subtasks using the moving average of power consumption and defines patterns through curve fitting, and the scheduling step that allocates the subtasks to cores and applies dynamic voltage and frequency scaling (DVFS). According to the results of experiment, the algorithm decreased the frequency of peak power by up to around 73% and average power consumption by up to around 18% compared to existing algorithms.

References

[1]
Byungyu Ahn, SungHwan Park, and Jongwha Chong, "Subtask Priority Scheduling for Multiprocessor under Peak Power Constraint," The 21st Workshop on Circuits and Systems in K aruizawa, April 2008.
[2]
Xizhou Feng, "Power and Energy Profiling of Scientific Applications on Distributed Systems," Proc. of Parallel and Dist ributed Processing Symposium, 2005. 19th IEEE, pp.34--44, April 2005.
[3]
Rodney M. LaFollette, "Design and Performance of High Specific Power, Pulsed Discharge, Bipolar Lead Acid Batteries, "10th Annual Battery Conference on Applications and Advances, Long Beach, pp. 43--47, January 1995.
[4]
Dennis G. Zill, Michael R. Cullen, "FUNDAMENTALS of EXECTRIC ANALYSIS," Jone WILEY, 2001.
[5]
Matthew R. Guthaus, "MiBench: A free, commercially representative embedded benchmark suite," 2001 IEEE International Workshop on Workload Characterization, pp.3--14, Dec 2001.
[6]
Chung-Hsing Hsu, U. Kremer, and M. Hsiao, "Compiler-Directed Dynamic Voltage/Frequency Scheduling for Energy Reduction in Microprocessors," Low Power Electronics and Design, International Symposium on, 2001. Pages 275--278, August 2001.
[7]
Gary Chartrand, and Ortrud R. Oellermann, "Applied and Algorithmic Graph Theory," Mcgraw-Hill College, July 1, 1992

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
February 2009
704 pages
ISBN:9781605584058
DOI:10.1145/1516241
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 February 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. low power
  2. multi-core
  3. peak power control
  4. task scheduling

Qualifiers

  • Research-article

Funding Sources

Conference

ICUIMC '09
Sponsor:

Acceptance Rates

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 106
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media