Maze routing steiner trees with delay versus wire length tradeoff

• Autor(a) principal: Hentschke, Renato Fernandes
• Data de Publicação: 2009
• Outros Autores: Narasimhan, Jaganathan, Johann, Marcelo de Oliveira, Reis, Ricardo Augusto da Luz
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UFRGS
• Texto Completo: http://hdl.handle.net/10183/27623
• topic: Microeletrônica; Vlsi; Delay; Maze search; Routing; Steiner trees

In this paper, we address the problem of generating good topologies of rectilinear Steiner trees using path search algorithms. Various techniques have been applied in order to achieve acceptable run times on a Maze Router that builds Steiner trees. A biasing technique proposed for wire length improvement, produces trees that are within 2% from optimal topologies in average. By introducing a sharing factor and a path-length factor we show how to trade-off wire length for delay. Experimental results show that our algorithm generates topologies with better delay compared to state of the art heuristics for Steiner trees, such as AHHK (from 26% to 40%) and P-Trees (from 1% to 30% and from 6% to 21% in the presence of blockages) while keeping the properties of a routing algorithm. An important motivation for this work lies in the fact that it can be used for estimation in the early stages as well as for actual routing, thereby improving the convergence and timing closure of the design significantly.We also provide some valuable theoretical background and insights on delay optimization and on how it relates to our maze router implementation.