A fast longer path algorithm for routing grid with obstacles using biconnectivity based length upper bound

Authors:
Yukihide Kohira;Suguru Suehiro;Atsushi Takahashi
Affiliations:
Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan;Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan;Tokyo Institute of Technology, Meguro-ku, Tokyo, Japan
Venue:
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Year:
2009

Citing 2
Cited 3

Algorithmic study of single-layer bus routing for high-speed boards

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

CAFE router: a fast connectivity aware multiple nets routing algorithm for routing grid with obstacles

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Obstacle-aware longest path using rectangular pattern detouring in routing grids

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Obstacle-aware length-matching bus routing

Proceedings of the 2011 international symposium on Physical design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent VLSI systems, signal propagation delays are requested to achieve the specifications with very high accuracy. In order to meet the specifications, the routing of a net often needs to be detoured in order to increase the routing delay. A routing method should utilize a routing area with obstacles as much as possible in order to realize the specifications of nets simultaneously. In this paper, a fast longer path algorithm that generates a path of a net in routing grid so that the length is increased as much as possible is proposed. In the proposed algorithm, an upper bound for the length in which the structure of a routing area is taken into account is used. Experiments show that our algorithm utilizes a routing area with obstacles efficiently.