Highly Scalable Algorithms for Rectilinear and 在直线和高度可扩展的算法.pptVIP

A.B. Kahng, Ion I. Mandoiu University of California at San Diego, USA A.Z. Zelikovsky Georgia State University, USA Supported in part by MARCO GSRC and Cadence Design Systems, Inc. Outline Single net routing problem Problem definition Previous work Motivation for highly scalable heuristics The batched greedy algorithm High-level algorithm Efficient generation of triples Efficient bottleneck-edge computation Experimental results and conclusions Single Net Routing Problem Why Minimum Steiner Tree Routing? Advantages Minimum routing area Minimum total capacitance Reduced power consumption Ste