Path search on rectangular floorplan

Authors:
C. S. Ying;J. S. L. Wong;X. L. Hong;E. Q. Wang
Affiliations:
Tsinghua University, Beijing, P. R. China;Hong Kong polytechnic, Hong Kong;Tsinghua University, Beijing, P. R. China;Tsinghua University, Beijing, P. R. China
Venue:
EURO-DAC '90 Proceedings of the conference on European design automation
Year:
1990

Citing 5
Cited 1

On finding Steiner vertices

Networks
A dynamic and efficient representation of building-block layout

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A path selection global touter

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Hierarchial global wiring for custom chip design

DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Algorithms for global routing

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

Performance-driven Steiner tree algorithm for global routing

DAC '93 Proceedings of the 30th international Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wiring among rectangular blocks is an important component in hierarchical layout. This paper presents algorithms for path search on rectangular floorplan. A fast Steiner tree algorithm of linear complexity is proposed based on a new heuristic of converging search. Taking into account the positional distribution of terminals on the floorplan, it finds the subconnections for each terminal simultaneously and in an order independent manner; this often yields global optimum connection of terminals. Experimental results show that the new algorithm out-performs other popular sequential methods for the problem at hand in most cases.