Proceedings ArticleDOI
A Fast Maze Router with Iterative Use of Variable Search Space Restriction
Fumiya Tada,Kiyoshi Yoshimura,Takashi Kagata,Takeyoshi Shirakawa +3 more
- pp 250-254
Reads0
Chats0
TLDR
Using this method, machine time was reduced to one-fourth and the routing completion ratio was more than 10% higher in experimental comparison with singly restricted routers of no iteration.Abstract:
This paper describes a new method of restricting search space for maze routing, to achieve a higher routing completion ratio and shorter machine time. The router is applied iteratively, expanding the width of L-shaped search space restriction from narrow one to wider ones successively. Using this method, machine time was reduced to one-fourth and the routing completion ratio was more than 10% higher in experimental comparison with singly restricted routers of no iteration. This paper also discusses an analysis to help to decide the iteration number and L-shaped path width.read more
Citations
More filters
Journal ArticleDOI
Systolic routing hardware: performance evaluation and optimization
Rob A. Rutenbar,D.E. Atkins +1 more
TL;DR: Experimental and theoretical comparisons suggest that the constant-increment heuristic exhibits performance within a factor of two of optimal over a range of hardware configurations, and is substantially easier to compute than the optimal solution.
Journal ArticleDOI
Lee router modified for global routing
Andrew Brown,Mark Zwolinski +1 more
TL;DR: It is shown that the modification described can decrease the standard deviation of the channel wiring density by 25%.
Proceedings ArticleDOI
A Full Over-the-Cell routing model
TL;DR: This paper describes a Full Over-the-Cell routing model to perform circuit connections over the transistors by using "transparent cells", which provides flexibility and the resulting layout style presents interesting performance/cost ratios if compared to those produced by Standard Cell and traditional Over theCell routing models.
Journal ArticleDOI
General gate array routing using a k-terminal net routing algorithm with failure prediction
E.P. Huijbregts,J.A.G. Jess +1 more
TL;DR: A general approach to gate array routing based on an abstract routing space model is presented and an efficient k-terminal net maze runner is described, showing that the explored routing space diminishes when compared to bidirectional routing schemes.
Proceedings ArticleDOI
A Multiple Terminal Net Routing Algorithm using Failure Prediction
E.P. Huijbregtst,J.A.G. Jess +1 more
TL;DR: Experimental results show an extru reduction of cpu-time up to 35% by using this new mechunism and it is shown this failure prediction Mechunism can be implemented in uny muze runner scheme without increusing the complexity of the algorithm.
References
More filters
Journal ArticleDOI
An Algorithm for Path Connections and Its Applications
TL;DR: The algorithm described in this paper is the outcome of an endeavor to answer the following question: Is it possible to find procedures which would enable a computer to solve efficiently path-connection problems inherent in logical drawing, wiring diagramming, and optimal route finding?
Journal ArticleDOI
The Lee Path Connection Algorithm
TL;DR: It is shown that the original claim of generality for the path cost function is incorrect, and a restriction, called the pathconsistency property, is introduced, and the Lee algorithm holds for those path cost functions having this property.
Proceedings ArticleDOI
Fast Maze Router
TL;DR: The method combines two techniques: a line search is first directed toward the target, and an expansion technique typical for the Lee-type algorithms is then used to “bubble” around the obstacle.