Two-layer bus routing for high-speed printed circuit boards

The increasing clock frequencies in high-end industrial circuits bring new routing challenges that cannot be handled by traditional algorithms. An important design automation problem for high-speed boards today is routing nets within tight minimum and maximum length bounds. In this article, we propose an algorithm for routing bus structures between components on two layers such that all length constraints are satisfied. This algorithm handles length extension simultaneously during the actual routing process so that maximum resource utilization is achieved during length extension. Our approach here is to process one track at a time, and choose the best subset of nets to be routed on each track. The algorithm we propose for single-track routing is guaranteed to find the optimal subset of nets together with the optimal solution with length extension on one track. The experimental comparison with a recently proposed technique shows the effectiveness of this algorithm both in terms of solution quality and run-time.

[1]  A. Kahng,et al.  On optimal interconnections for VLSI , 1994 .

[2]  Michael Burstein,et al.  Hierarchical Channel Router , 1983, 20th Design Automation Conference Proceedings.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Jason Cong,et al.  Bounded-skew clock and Steiner routing , 1998, TODE.

[5]  Cheng-Kok Koh,et al.  UST/DME: a clock tree router for general skew constraints , 2000, TODE.

[6]  Somchai Prasitjutrakul,et al.  A timing-driven global router for custom chip design , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  Muhammet Mustafa Ozdal,et al.  Length-Matching Routing for High-Speed Printed Circuit Boards , 2003, ICCAD 2003.

[8]  Andrew B. Kahng,et al.  On the Bounded-Skew Clock and Steiner Routing Problems , 1995, 32nd Design Automation Conference.

[9]  Carl Ebeling,et al.  Placement and routing tools for the Triptych FPGA , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[10]  Jason Cong,et al.  Provably good performance-driven global routing , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  R.L. Rivest,et al.  A "Greedy" Channel Router , 1982, 19th Design Automation Conference.

[12]  Seokjin Lee,et al.  Timing-driven routing for FPGAs based on Lagrangian relaxation , 2002, ISPD '02.

[13]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[14]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[15]  A. S. LaPaugh,et al.  ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH , 1980 .

[16]  Thomas G. Szymanski Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Vaughn Betz,et al.  VPR: A new packing, placement and routing tool for FPGA research , 1997, FPL.

[18]  A. Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[19]  Vishwani D. Agrawal,et al.  Chip Layout Optimization Using Critical Path Weighting , 1984, 21st Design Automation Conference Proceedings.

[20]  Wu-Shiung Feng,et al.  A new efficient approach to multilayer channel routing problem , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[21]  D F WongMartin,et al.  Two-layer bus routing for high-speed printed circuit boards , 2006 .