Abstract

A fast algorithm is developed for the analysis and design of very large-scale on-die power grids. The structure specialty of on-chip power grids such as Manhattan geometry and layered permittivity is preserved in the proposed algorithm, and the resulting disadvantage in time step is overcome. As a result, the large-scale matrix solution encountered in the 3-D power grid analysis is turned into a simple scaling of the solution of a small 1-D tridiagonal matrix, which can be obtained in linear (optimal) complexity with negligible cost. Meanwhile, the time step size is not sacrificed, and the total number of time steps to be simulated is also significantly reduced, thus achieving a total cost reduction in CPU time. Applications to the simulation of very large-scale on-chip power grids on a single core have demonstrated the superior performance of the proposed method.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.