Detailed Routing Algorithms for Advanced Technology Nodes

Abstract

In our paper we present new detailed routing algorithms dealing with challenges in advanced technology nodes, such as complex design rules and multiple patterning. We combine our routing tool, BonnRoute, with an industrial router for cleaning up remaining design rule violations and demonstrate superior routing results over that industrial router on real-world multiple patterning designs. This paper has never been submitted for publication anywhere else.On behalf of all authors, Michael GesterAbstract-We present algorithms for routing in advanced technology nodes, used by BonnRoute to obtain efficient and almost design rule clean wire packings and pin access solutions. Designs with dense standard cell libraries in presence of complex industrial design rules, with a special focus on multiple patterning lithography, are considered. The key components of this approach are a multi-label interval-based shortest path algorithm for long on-track connections, and a dynamic program for computing packings of pin access paths and short connections between closely spaced pins. The multi-label path search implementation is very general and is driven with different labeling rules, allowing to trade off runtime against accuracy in terms of obeyed design rules. We combine BonnRoute with an industrial router for cleaning up the remaining design rule violations, and demonstrate superior results over that industrial router in our experiments in terms of wire length, number of vias, design rule violations and runtime.

A Survey of Swarm Intelligence Techniques in VLSI Routing Problems

“…In order to make up for the effect of the order of nets on global results, the serial routing usually refines the routing results by means of rip-up and reroute, and can quickly obtain a good quality solution. But these serial routing methods [99], [100] may generate some invalid solutions, while the parallel detailed routing algorithms based on the multi-commodity flow model [44] can simultaneously route multiple nets. However, these algorithms do not take into account the delay optimization problem and the complexity is too high, which cannot solve the performance-driven routing problem well.…”

DABFS: A robust routing protocol for warning messages dissemination in VANETs

“…Another protocol in [20] adopts local search with multi-objective optimization for route discovery in a unidirectional traffic scenario. Among the multiple routes to a destination, optimal route discovery is a challenging task, for which the protocol proposed in [21] provides a decent solution. Moreover, the authors in [53] propose a novel Connectivity-Aware Data Dissemination (CADD) protocol that uses wavelet neural network to predict the forwarding capability of a certain node.…”

Toward Unidirectional Routing Closure in Advanced Technology Nodes

“…However, high routing densities and severe routing resource competitions on lower metal layers cause significant routing overhead for the router. An alternative to reduce routing overhead is to design and optimize pin access routing intervals concurrently for all I/O pins, which are fed into the router for better routing closure [1], [50]. The routing interval generation and assignment approach resolves the routing resource competitions among I/O pins on lower metal layers concurrently before the routing phase starts.…”

“…In advanced technology nodes, this problem becomes more challenging due to high routing density and advanced manufacturing constraints. Without delivering details on the routing interval generation, BonnRoute further generalizes the maximum weighted independent set algorithm to compute routing interval assignment for each I/O pin with maximum profits [1]. Our recent routing study provides novel solutions for both routing interval generation and assignment.…”