Sciweavers

53 search results - page 1 / 11
» Timing driven maze routing
Sort
View
ISPD
1999
ACM
106views Hardware» more  ISPD 1999»
13 years 9 months ago
Timing driven maze routing
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
Sung-Woo Hur, Ashok Jagannathan, John Lillis
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
13 years 10 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
GLVLSI
2002
IEEE
127views VLSI» more  GLVLSI 2002»
13 years 10 months ago
A new look at hardware maze routing
This paper describes a new design for a hardware accelerator to support grid-based Maze Routing. Based on the direct mapped approach of Breuer and Shamsa [3], this work refines th...
John A. Nestor
ACRI
2006
Springer
13 years 11 months ago
A Maze Routing Algorithm Based on Two Dimensional Cellular Automata
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...
Shahram Golzari, Mohammad Reza Meybodi
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 1 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young