DpRouter: A Fast and Accurate Dynamic-Pattern-Based Global Routing Algorithm

  • Authors:
  • Zhen Cao;Tong Jing;Jinjun Xiong;Yu Hu;Lei He;Xianlong Hong

  • Affiliations:
  • Computer Science&Technology Department, Tsinghua University, Beijing 100084, China. Phone: +86-10-62;Computer Science&Technology Department, Tsinghua University, Beijing 100084, China. Phone: +86-10-62;Electrical Engineering Department, UCLA, Los Angeles, CA, 90095, USA. Phone: (310) 267-5407/ IBM Res;Electrical Engineering Department, UCLA, Los Angeles, CA, 90095, USA. Phone: (310) 267-5407, e-mail:;Electrical Engineering Department, UCLA, Los Angeles, CA, 90095, USA. Phone: (310) 267-5407, e-mail:;Computer Science&Technology Department, Tsinghua University, Beijing 100084, China. Phone: +86-10-62

  • Venue:
  • ASP-DAC '07 Proceedings of the 2007 Asia and South Pacific Design Automation Conference
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a fast and accurate global routing algorithm, DpRouter, based on two efficient techniques: (1) dynamic pattern routing (Dpr), and (2) segment movement. These two techniques enable DpRouter to explore large solution space to achieve better routability with low time complexity. Compared with the state-of-the-arts, experimental results show that we consistently obtain better routing quality in terms of both congestion and wire length, while simultaneously achieving a more than 30x runtime speedup. We envision that this algorithm can be further leveraged in other routing applications, such as FPGA routing.