基于变步长随机行走算法的IC电源网络动态分析

Dynamic Analysis of IC Power Network Based on Variable Step Size Random Walk Algorithm

针对传统随机行走算法加速策略在处理大规模电源网络时存在局限性的问题,提出一种基于变步长的随机行走加速算法.首先,基于不同节点数目和阈值大小的实验对比,分析传统随机行走加速算法和变步长随机行走加速算法的时间效率,并证明变步长随机行走加速算法使电源网络分析效率得到极大提高.其次,证明随机行走算法具有空间局部性特征,能进一步使运行空间得到释放.通过对不同规模电源网络进行实验验证表明,该方法能使算法运行空间得到优化.

Aiming at the problem that the acceleration strategy of the traditional random walking algorithm had some limitations when dealing with large-scale power grids,we proposed a random walking acceleration algorithm based on variable step size.Firstly,based on the experimental comparison of different number of nodes and threshold size,the time efficiency of traditional random walking acceleration algorithm and variable step size random walking acceleration algorithm was analyzed,then it was proved that the variable step size random walking acceleration algorithm could greatly improve the efficiency of power grids analysis.Secondly,we proved that the random walking algorithm had spatial local characteristics,which could further release the running space.Experiments on power grids of different scales show that the method can optimize the running space of the algorithm.