Algorithms for global routing

Authors:
J. G. Xiong
Affiliations:
-
Venue:
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Year:
1986

Citing 0
Cited 3

A path selection global touter

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic

EDTC '97 Proceedings of the 1997 European conference on Design and Test
Path search on rectangular floorplan

EURO-DAC '90 Proceedings of the conference on European design automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents several algorithms for global routing, including a very fast shortest path connection algorithm based on wave propagation and diffraction, a heuristic minimum tree algorithm using 'Common Edge' analysis, an overflow control method, and global rerouting treatment. These algorithms have been implemented in C and very good experimental results have been obtained.