A path selection global touter

Authors:
Y. C. Hsu;Y. Pan;W. J. Kubitz
Affiliations:
Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield, Urbana, Illinois;Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield, Urbana, Illinois;Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield, Urbana, Illinois
Venue:
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Year:
1987

Citing 5
Cited 2

Shortest paths in Euclidean graphs

Algorithmica
Algorithms for global routing

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
A Discipline of Programming

A Discipline of Programming
A global routing algorithm for general cells

DAC '84 Proceedings of the 21st Design Automation Conference
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Path search on rectangular floorplan

EURO-DAC '90 Proceedings of the conference on European design automation
A maze routing algorithm based on two dimensional cellular automata

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new path selection heuristic search algorithm is proposed for connecting two components of vertices. A novel feature of the algorithm is that the active terminals (vertices in the net which are not yet connected) are modeled as magnets during the path searching process. The heuristic search algorithm is applied to two commonly used multi-terminal net tree connection algorithms. Experimental results show that the new path selection heuristic search algorithm is better than the other algorithms which do not consider the active terminals.