• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Luo Zuying, Zhang Yubin, Yu Xianchuan. A Single Open-Defect Analysis Method for Power/Ground Networks[J]. Journal of Computer Research and Development, 2009, 46(7): 1234-1240.
Citation: Luo Zuying, Zhang Yubin, Yu Xianchuan. A Single Open-Defect Analysis Method for Power/Ground Networks[J]. Journal of Computer Research and Development, 2009, 46(7): 1234-1240.

A Single Open-Defect Analysis Method for Power/Ground Networks

More Information
  • Published Date: July 14, 2009
  • With IC technology scaling down into nanometer regime, voltage disturbances severely influence the performance of VLSI circuits. Both via mismatches in manufacture and electro-migrations of Cu interconnect wires in working ICs may provide many candidates for open defects in power/ground networks, which in turn significantly impacts voltage disturbances. In order to quickly test these open defects, it is imperative to efficiently analyze the defects’ influences on P/G networks. Therefore, a single defect successive over-relaxation algorithm (SD-SOR) is firstly proposed in this paper to fast analyze nodal voltage drop distributions of P/G networks resulted from single open defect. Based on the voltage distribution of a defect-free P/G network, SD-SOR only needs to relax on a few nodes that surround the defect and thus suffer visible influences from the defect. Compared with the traditional global SOR method that orderly relaxes all nodes, SD-SOR shows the following advantages. The first advantage is locality. For each open defect, SD-SOR relaxes from the nodes connected with the defect to those surrounding nodes as wave transmission, while the wave stops at the nodes whose IR droop variation is less than a pre-assigned threshold. The second one is efficiency. SD-SOR not only relaxes a small part of the nodes in P/G networks but also needs much less relaxation iterations. The third one is high accuracy. Because most nodes are far away from the defect and suffer invisible influences, SD-SOR can obtain high enough accuracy through relaxing only a few surrounding nodes. Experimental ressults show that the proposed SD-SOR method is 57 times faster than the pre-conditional global SOR method with a maximum error of 0.95%.
  • Related Articles

    [1]Ren Jiadong, Liu Xinqian, Wang Qian, He Haitao, Zhao Xiaolin. An Multi-Level Intrusion Detection Method Based on KNN Outlier Detection and Random Forests[J]. Journal of Computer Research and Development, 2019, 56(3): 566-575. DOI: 10.7544/issn1000-1239.2019.20180063
    [2]Liu Lu, Zuo Wanli, Peng Tao. Tensor Representation Based Dynamic Outlier Detection Method in Heterogeneous Network[J]. Journal of Computer Research and Development, 2016, 53(8): 1729-1739. DOI: 10.7544/issn1000-1239.2016.20160178
    [3]Zhao Xingwang, Liang Jiye. An Attribute Weighted Clustering Algorithm for Mixed Data Based on Information Entropy[J]. Journal of Computer Research and Development, 2016, 53(5): 1018-1028. DOI: 10.7544/issn1000-1239.2016.20150131
    [4]Huang Tianqiang, Yu Yangqiang, Guo Gongde, Qin Xiaolin. Trajectory Outlier Detection Based on Semi-Supervised Technology[J]. Journal of Computer Research and Development, 2011, 48(11): 2074-2082.
    [5]Zhang Jing, Sun Zhihui, Yang Ming, Ni Weiwei, Yang Yidong. Fast Incremental Outlier Mining Algorithm Based on Grid and Capacity[J]. Journal of Computer Research and Development, 2011, 48(5): 823-830.
    [6]Yu Hao, Wang Bin, Xiao Gang, Yang Xiaochun. Distance-Based Outlier Detection on Uncertain Data[J]. Journal of Computer Research and Development, 2010, 47(3): 474-484.
    [7]Ni Weiwei, Chen Geng, Lu Jieping, Wu Yingjie, Sun Zhihui. Local Entropy Based Weighted Subspace Outlier Mining Algorithm[J]. Journal of Computer Research and Development, 2008, 45(7): 1189-1194.
    [8]Jin Yifu, Zhu Qingsheng, Xing Yongkang. An Algorithm for Clustering of Outliers Based on Key Attribute Subspace[J]. Journal of Computer Research and Development, 2007, 44(4): 651-659.
    [9]Ni Weiwei, Lu Jieping, Chen Geng, and Sun Zhihui. An Efficient Data Stream Outliers Detection Algorithm Based on k-Means Partitioning[J]. Journal of Computer Research and Development, 2006, 43(9): 1639-1643.
    [10]Yang Yidong, Sun Zhihui, Zhang Jing. Finding Outliers in Distributed Data Streams Based on Kernel Density Estimation[J]. Journal of Computer Research and Development, 2005, 42(9): 1498-1504.

Catalog

    Article views (751) PDF downloads (538) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return