Hierarchical Netlist Power Optimization via Slack Apportionment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional integrated circuit design methods optimize for timing but neglect power efficiency, leading to increased heat dissipation and costly cooling solutions due to the lack of power-aware timing assertions in hierarchical netlists.
Innovation Solution
A method to generate modified timing assertions by apportioning slack amongst macros based on power-related parameters, such as gate width, physical size, and activity factors, to optimize both timing and power performance in hierarchical netlists.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If conventional timing analysis is performed to optimize circuit speed, then operational speed is improved, but power dissipation increases
Solution Approach 1:
The patent modifies timing assertions by introducing power-aware parameters (activity factors, gate width, physical size) alongside traditional timing parameters. This allows the timing analysis to consider both speed and power consumption, adjusting timing parameters to achieve an optimal balance between operational speed and power dissipation rather than optimizing for speed alone.
Solution Approach 2:
The patent creates a dynamic timing assertion adjustment mechanism that iteratively modifies timing parameters based on power consumption characteristics. The system dynamically adjusts timing assertions in response to power consumption data, allowing the circuit design to adapt between speed and power optimization based on the specific operational conditions and power-aware parameters.
2Loss of energy
If timing assertions are adjusted to reduce power dissipation, then power efficiency is improved, but timing performance may deteriorate
Solution Approach 1:
The patent introduces power-aware parameters (activity factors, gate width, physical size) as additional dimensions for timing assertion adjustment. By considering these additional parameters alongside traditional timing parameters, the system can make informed adjustments that reduce power dissipation while maintaining acceptable timing performance through multi-parameter optimization.
Solution Approach 2:
The system implements dynamic adjustment of timing assertions that responds to power consumption characteristics. The timing parameters are not fixed but are continuously optimized based on power-aware parameters, allowing the system to find optimal balance points between power efficiency and timing performance through iterative adjustment.
3Device complexity
If hierarchical design methodology is used to partition circuits into macros, then design complexity is reduced, but power optimization is lost
Solution Approach 1:
The patent maintains the hierarchical design methodology that partitions circuits into macros, which helps manage design complexity. However, it extends the timing assertions to operate at the macro level with power-aware parameters, allowing power optimization to be performed within the hierarchical structure rather than losing it. The segmentation is preserved while adding power-aware timing adjustment capabilities.
Solution Approach 2:
The patent modifies the timing assertions used in hierarchical design by incorporating power-aware parameters (activity factors, gate width, physical size) at the macro level. This allows power optimization to be integrated into the hierarchical design process itself, maintaining both the structural benefits of macro partitioning and the ability to optimize power consumption through adjusted timing parameters.
Data Source
AI summary
The invention generally relates to integrated circuit design, and more particularly to systems and methods for providing power optimization in a hierarchical netlist. A method includes generating a hierarchical netlist of the design, wherein the design includes a plurality of macros. The method also includes determining the timing slack of each path of the design. For each pin of each one of the plurality of macros, the method includes: determining the worst timing path; determining the slack value of the worst timing path; determining the subset of macros of the plurality of macros associated with the worst timing path; determining an apportionment parameter for each one of the subset of macros; determining a distribution of the slack amongst the subset of macros based upon the respective apportionment parameters; and adjusting timing assertions for each one of the subset of macros based upon the distribution of the slack.