ACM Home Page
Please provide us with feedback. Feedback
Optimizing intra-task voltage scheduling using data flow analysis
Full text PdfPdf (757 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2005 Asia and South Pacific Design Automation Conference table of contents
Shanghai, China
SESSION: Design techniques in embedded and real-time system table of contents
Pages: 703 - 708  
Year of Publication: 2005
ISBN:0-7803-8737-6
Authors
Dongkun Shin  Seoul National University, Seoul, Korea
Jihong Kim  Seoul National University, Seoul, Korea
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
: Shanghai IC Industry Association
: IEEE SSCS Shanghai Chapter
: IEEE CAS
: IEEE Beijing Section
: Fudan University
: Chinese Institute of Electronics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 28,   Citation Count: 5
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1120725.1120998
What is a DOI?

ABSTRACT

Intra-task voltage scheduling (IntraDVS), which adjusts the supply voltage within an individual task boundary, is an effective technique for developing low-power applications. In IntraDVS, slack times are estimated by analyzing program's control flow information. In this paper, we propose an optimization technique for IntraDVS using data flow information. The proposed algorithm improves the energy efficiency by moving the voltage scaling points to earlier instructions based on the analysis results of program's data flow. The experimental results using an MPEG-4 encoder program show that the proposed algorithm reduces the energy consumption by 40-45% over the original IntraDVS algorithm.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Bjorn. Fully Automatic, Parametric Worst-Case Execution Time Analysis. In Proc. of International Workshop on Worst-Case Execution Time Analysis, pages 85--88, 2003.
 
4
5
6
7
 
8
9
 
10
M. Weiser. Program Slicing. IEEE Transactions on Software Engineering, 10(4):352--357, 1984.

Collaborative Colleagues:
Dongkun Shin: colleagues
Jihong Kim: colleagues