Abstract
The exponential increase in leakage power and the substantial power-saving opportunities provided by scheduling have made dual-threshold voltage (dual- $V_{\mathrm{ th}}$ ) an attractive choice for low-leakage-power designs. In this paper, we work under the assumption that functional units (FUs) are allocated after scheduling, and fully explore the solution space of scheduling with dual- $V_{\mathrm{ th}}$ operations to optimize the leakage power of the FUs. First, a binding conflict graph (BCG)-based scheduling method is presented to minimize the number of FUs. Second, the BCG-based method is extended to allow scheduling with dual- $V_{\mathrm{ th}}$ operation targeting the minimization of leakage power. In timing-constrained scheduling, each operation in the data flow is initialized with low- $V_{\mathrm{ th}}$ . Then, starting from an operation schedule with the timing constraint satisfied, we scale the sets of low- $V_{\mathrm{ th}}$ operations in the off-critical paths with high- $V_{\mathrm{ th}}$ so as to reduce the number of low- $V_{\mathrm{ th}}$ FUs without increasing the total delay. Finally, a scheduling method for minimizing the leakage power under both timing and resource constraints is presented. The results of benchmark tests show that the proposed algorithms can reduce the leakage power reported in previous works by 10.2% while maintaining high circuit performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.