A fast algorithm for optimal wire-sizing under Elmore delay model

We present a fast algorithm for continuous wire-sizing under the distributed Elmore delay model. Our algorithm GWSA-C, an extension of the GWSA algorithm (for discrete wire-sizing), is an iterative algorithm with guaranteed convergence to optimal wire-sizing solutions. When specialized to discrete wire-sizing problems, GWSA-C is an improved implementation of GWSB, both in terms of runtime and memory usage. GWSA-C is extremely fast even on very large problems. For example, we can solve a 1,000,000 wire-segment problem in less than 3 minutes runtime on an IBM RS/6000 workstation.