Results 1 
8 of
8
Highly scalable algorithms for rectilinear and octilinear Steiner trees
 In Proc. Asian and South Pacific Design Automation Conf
, 2003
"... problem, which asks for a minimumlength interconnection of a given set of terminals in the rectilinear plane, is one of the fundamental problems in electronic design automation. Recently there has been renewed interest in this problem due to the need for highly scalable algorithms able to handle ne ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
(Show Context)
problem, which asks for a minimumlength interconnection of a given set of terminals in the rectilinear plane, is one of the fundamental problems in electronic design automation. Recently there has been renewed interest in this problem due to the need for highly scalable algorithms able to handle nets with tens of thousands of terminals. In this paper we give a practical � heuristic for computing nearoptimal rectilinear Steiner trees based on a batched version of the greedy triple contraction algorithm of Zelikovsky [21]. Experiments conducted on both random and industry testcases show that our heuristic matches or exceeds the quality of best known RSMT heuristics, e.g., on random instances with more than 100 terminals our heuristic improves over the rectilinear minimum spanning tree by an average of 11%. Moreover, our heuristic has very well scaling runtime, e.g., it can route a 34kterminals net extracted from a real design in less than 25 seconds compared to over 86 minutes needed by the edgebased heuristic of Borah, Owens, and Irwin [3]. Since our heuristic is graphbased, it can be easily modified to handle practical considerations such as routing obstacles, preferred directions, via costs, and octilinear routing – indeed, experimental results show only a small factor increase in runtime when switching from rectilinear to octilinear routing. I.
Minimum steiner tree construction
 IN ALPERT, C.J., MEHTA, D.P. AND SAPATNEKAR, S.S. (EDS), THE HANDBOOK OF ALGORITHMS FOR VLSI PHYSICAL DESIGN AUTOMATION
, 2009
"... ..."
(Show Context)
Viaaware global routing for good VLSI manufacturability and high yield
 in Proc. of ASAP 2005
"... CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called systemonachip (SOC), in which physical design tool is an essential and critical part. We try to consider the via minimization problem as early as ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called systemonachip (SOC), in which physical design tool is an essential and critical part. We try to consider the via minimization problem as early as possible in physical design. We propose a routing method focusing on minimizing vias while considering routability and wirelength constraint. That is, in the global routing phase, we minimize the number of bends, which is closely related to the number of vias. Previous work only dealt with very small nets, but our algorithm is general for the nets with any size. Experimental results show that our algorithm can greatly reduce the count of bends for various sizes of nets while meeting the constraints of congestion and wirelength. 1.
Computing the Stretch Factor of Paths, Trees, and Cycles in Weighted Fixed Orientation Metrics
 CCCG
, 2008
"... Let G be a graph embedded in the L1plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio L G 1 (p, q)/L1(p, q), where L G 1 (p, q) is the L1distance in G between p and q. We show how to compute the stretch factor of an nvertex path in O(n log ..."
Abstract
 Add to MetaCart
(Show Context)
Let G be a graph embedded in the L1plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio L G 1 (p, q)/L1(p, q), where L G 1 (p, q) is the L1distance in G between p and q. We show how to compute the stretch factor of an nvertex path in O(n log 2 n) worstcase time and O(n) space and we mention generalizations to trees and cycles, to general weighted fixed orientation metrics, and to higher dimensions.