Nearly optimal algorithms and bounds for multilayer channel routing

  • Authors:
  • Bonnie Berger;Martin Brady;Donna Brown;Tom Leighton

  • Affiliations:
  • Massachusetts Institute of Technology, Cambridge;Pennsylvania State Univ., University Park, PA;Univ. of Illinois, Urbana;Massachusetts Institute of Technology, Cambridge

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents algorithms for routing channels with L≥2 layers. For the unit vertical overlap model, we describe a two-layer channel routing algorithm that uses at most d+Od tracks to route two-terminal net problems and 2d+od tracks to route multiterminal nets. We also show that d+Wlog d tracks are required to route two-terminal net problems in the worst case even if arbitrary vertical overlap is allowed. We generalize the algorithm to unrestricted multilayer routing and use only d/L-1+O d/L+1 tracks for two-terminal net problems (within within Od/L+ 1tracks of optimaland d/L-2+O d/L+1 tracks for multiterminal net problems within a factor ofL-1 /L-2times optimal . We demonstrate the generality of our routing strategy by showing that it can be used to duplicate some of the best previous upper bounds for other models (two-layer Manhattan routing and two and three-layer knock-knee routing of two-terminal, two-sided nets), and gives a new upper bound for rotuing with 45-degree diagonal wires.