skip to main content
10.1145/2480362.2480645acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Throughput-constrained voltage and frequency scaling for real-time heterogeneous multiprocessors

Authors Info & Claims
Published:18 March 2013Publication History

ABSTRACT

Voltage and Frequency Scaling (VFS) can effectively reduce energy consumption at system level. Most work in this field has focused on deadline-constrained applications with finite schedule lengths. However, in typical real-time streaming, processing is repeatedly activated by indefinitely long data streams and operations on successive data instances are overlapped to achieve a tight throughput. A particular application domain where such characteristics co-exist with stringent energy consumption constraints is baseband processing. Such behavior requires new VFS scheduling policies. This paper addresses throughput-constrained VFS problems for real-time streaming with discrete frequency levels on a heterogeneous multiprocessor.

We propose scaling algorithms for two platform types: with dedicated VFS switches per processor, and with a single, global VFS switch. We formulate Local VFS using Mixed Integer Linear Programming (MILP). For the global variant, we propose a 3-stage heuristic incorporating MILP.

Experiments on our modem benchmarks show that the discrete local VFS algorithm achieves energy savings close to its continuous counterpart, and local VFS is more effective than global VFS. As an example, for a WLAN receiver, running on a modem realized as a heterogeneous multiprocessor, the continuous local VFS algorithm reduces energy consumption by 29%, while the discrete local and global algorithms reduce energy by 28% and 16%, respectively, when compared to a on/off energy saving policy.

References

  1. Glpk. http://www.gnu.org/software/glpk/.Google ScholarGoogle Scholar
  2. Lingo. http://www.lindo.com/index.php.Google ScholarGoogle Scholar
  3. M. Aloulou, M. Y. Kovalyov, and M. Portmann. Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity. RAIRO - Operations Research, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  4. A. Andrei et al. Overhead-conscious voltage selection for dynamic and leakage energy reduction of time-constrained systems. In DATE. IEEE, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. P. Chandrakasan et al. Low Power Digital CMOS Design. Kluwer, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Y. He, Q. Wei, and T. C. Cheng. Single-machine scheduling with trade-off between number of tardy jobs and compression cost. Journal of Scheduling, October 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. Lee and D. Messerschmitt. Synchronous data flow: Describing signal processing algorithm for parallel computation. In COMPCON, 1987.Google ScholarGoogle Scholar
  8. H. Liu, Z. Shao, M. Wang, and P. Chen. Overhead-aware system-level joint energy and performance optimization for streaming applications on multiprocessor systems-on-chip. ECRTS '08. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. O. Moreira. Temporal Analsis and Scheduling of Hard Real-Time Radios on a Multi-processor. PhD thesis, Eindhoven University, Netherlands, 2012.Google ScholarGoogle Scholar
  10. A. Nelson et al. Power minimisation for real-time dataflow applications. In EUROMICRO DSD, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Y. Nesterov et al. Interior-Point Polynomial Algorithms in Convex Programming. Studies in Applied and Numerical Mathematics. Society for Industrial and Applied Mathematics, 1987.Google ScholarGoogle Scholar
  12. K. Parhi and D. Messerschmitt. Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding. IEEE Trans. Comput., Feb. 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Rockafellar. Convex analysis. Princeton Mathematical Series. Princeton University Press, 1997.Google ScholarGoogle Scholar
  14. K. Seth et al. Fast: Frequency-aware static timing analysis. ACM TECS, Feb. 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Sinha. Mathematical Programming: Theory and Methods. Elsevier Science Ltd, 2006.Google ScholarGoogle Scholar
  16. S. Sriram and S. Bhattacharyya. Embedded multiprocessors. Marcel Dekker, 2000.Google ScholarGoogle Scholar
  17. K. van Berkel et al. Vector processing as an enabler for software-defined radio in handheld devices. EURASIP J. Appl. Signal Process., January 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Y. Wang et al. Overhead-aware energy optimization for real-time streaming applications on multiprocessor system-on-chip. ACM TODAES, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. R. Xu, R. Melhem, and D. Mosse. Energy-aware scheduling for streaming applications on chip multiprocessors. RTSS, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced cpu energy. In Symp. on Foundations of Computer Science. IEEE, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Y. Zhang, X. S. Hu, and D. Z. Chen. Task scheduling and voltage selection for energy minimization. In Proc. DAC. ACM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. V. Zivojnovic and R. Schoenen. On retiming of multirate dsp algorithms. In Proc. IEEE Conference on Acoustics, Speech and Signal Processing, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

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

Sign in
  • Published in

    cover image ACM Conferences
    SAC '13: Proceedings of the 28th Annual ACM Symposium on Applied Computing
    March 2013
    2124 pages
    ISBN:9781450316569
    DOI:10.1145/2480362

    Copyright © 2013 ACM

    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: 18 March 2013

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

    Acceptance Rates

    SAC '13 Paper Acceptance Rate255of1,063submissions,24%Overall Acceptance Rate1,650of6,669submissions,25%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader