基于随机行走的电源pads分配算法  

Random-walk-based power pads assignment algorithm

作　　者：邓俊勇[1] 钱江华[1] 卓成[1] 周金芳[1] 陈抗生[1] 

机构地区：[1]浙江大学信息与电子工程学系,浙江杭州310027

出　　处：《浙江大学学报（工学版）》2008年第6期943-948,共6页Journal of Zhejiang University：Engineering Science

基　　金：浙江省自然科学基金资助项目(Y106513)

摘　　要：为了减少芯片上电源网格阻性(IR)压降,提出了一种基于随机行走的电源pads分配算法.该算法由通过随机行走法推导出的节点电源需求评价函数确定部分pads位置,剔除部分候选节点以减小搜索空间,并以候选节点和观察节点为端口建立电源网格宏模型,从而将电路规模降为候选节点和观察节点之和,以逐个pad分配的方法确定剩余pads的位置,以随机行走法结合"滑动窗口"快速计算简化电路中观察节点的最坏压降.对不同电源网格的仿真结果表明,该算法无论在准确性还是效率方面均具有很大的优越性,并且能在二者之间做很好的折衷.A random-walk-based algorithm for power pads assignment was proposed to minimize the on-die power grid （IR） voltage drop. This algorithm firstly used the evaluation function of nodes＇ power requirement deduced through random walk method to determine part of the power pads and remove part of the candidate nodes in order to decrease the searching room. Then a macro-model was built by using the observation nodes and candidate nodes of power pads as the ports to reduce the circuit size to the scale of the sum of observation nodes and candidate nodes. The remained power pads were assigned using successive pad assignment method. The algorithm efficiently calculated the worst voltage of the observation nodes with the random walk method combined with a ＂sliding window＂. Simulations of different power grids indicate that the proposed algorithm performs well in accuracy and efficiency and can make a good trade-off between them.

关 键 词：电源网格 电源pads分配 随机行走 宏模型 逐个pad分配 

分 类 号：TN47[电子电信—微电子学与固体电子学] TP391[自动化与计算机技术—计算机应用技术]