Optimization of the Power/Ground Network Wire-Sizing and Spacing Based on Sequential Network Simplex Algorithm

This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing which allows the length to change gives more flexibility in solving practical problems. There are two major contributions of this paper. First, we prove that for general topology, a relaxed version of this problem is also convex. Second, we present the sequential network simplex algorithm which can solve those problems with extreme efficiency. Experimental results on several large scale problems, using a PC with a 500-MHZ Pentium III processor, show that our algorithm can solve problems with hundreds of thousands of variables within a few minutes and has a speed improvement of 25+ over sequential linear programming [1]. Experimental results also show that about 50% of the power delivery area can be reduced using our algorithm.

• Type: Conference
• Year: 2002
• Where: ISQED
• Authors: Ting-Yuan Wang, Charlie Chung-Ping Chen
• Keywords: Algorithm, Dip/ground Bounce Constraints, Hardware, ISQED 2002, Network Simplex Algorithm