Algorithms for Global Routing

  • J. G. Xiong
  • Published 1986 in 23rd ACM/IEEE Design Automation Conference

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… (More)
DOI: 10.1145/318013.318167

Topics

Cite this paper

@article{Xiong1986AlgorithmsFG, title={Algorithms for Global Routing}, author={J. G. Xiong}, journal={23rd ACM/IEEE Design Automation Conference}, year={1986}, pages={824-830} }