loading...
An O(N)Supply Voltage Assignment Algorithm for Low-Energy Serially Connected CMOS Modules and a Heuristic Extension to Acyclic Data Flow Graphs
Tampa, Florida February 20-February 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVLSI.2003.1183443IEEE Computer Society Annual Symposiu ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Abdulkadir Utku Diril, Georgia Institute of Technology
Yuvraj Singh Dhillon, Georgia Institute of Technology
Kyu-won Choi, Georgia Institute of Technology
Abhijit Chatterjee, Georgia Institute of Technology
In this paper, a novel algorithm is proposed for assigning supply voltages to serially executing functional units (FUs) in a digital system such that the overall dynamic energy consumption is minimized for a given timing constraint. Novel closed form expressions for optimum supply voltage values are presented. The computation time of the algorithm is O(N)for N FUs in series. An extension of the O(N) algorithm is proposed for optimizing the acyclic data flow graph associated with any given task. Given the number of FUs available for the task, the operations required for the task are scheduled on the FUs. Voltages are then assigned to the FUs on each path of the flow graph using the O(N) algorithm. Energy savings of 10-60% are achieved on DSP filter designs using the proposed high-level optimization methodology over single supply voltage designs.
Citation:
Abdulkadir Utku Diril, Yuvraj Singh Dhillon, Kyu-won Choi, Abhijit Chatterjee, "An O(N)Supply Voltage Assignment Algorithm for Low-Energy Serially Connected CMOS Modules and a Heuristic Extension to Acyclic Data Flow Graphs," isvlsi, pp.173, IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.