A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards

As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. Therefore, it becomes important to route the nets within tight minimum and maximum length bounds. Although the problem of routing nets to satisfy maximum length constraints is a well-studied problem, there exists no sophisticated algorithm in literature that ensures that minimum length constraints are also satisfied. In this paper, the authors propose a novel algorithm that effectively incorporates the min;max length constraints into the routing problem. The approach is to use a Lagrangian-relaxation (LR) framework to allocate extra routing resources around nets simultaneously during routing them. The authors also propose a graph model that ensures that all the allocated routing resources can be used effectively for extending lengths. Their routing algorithm automatically prioritizes resource allocation for shorter nets and length minimization for longer nets so that all nets can satisfy their min;max length constraints. This paper demonstrates that this algorithm is effective even in the cases where length constraints are tight, and the spacing between adjacent nets is small

[1]  A. Renaud,et al.  Daily generation management at Electricite de France: from planning towards real time , 1993, IEEE Trans. Autom. Control..

[2]  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.

[3]  X. Guan,et al.  New Lagrangian Relaxation Based Algorithm for Resource Scheduling with Homogeneous Subproblems , 2002 .

[4]  Jason Cong,et al.  Performance-driven global routing for cell based ICs , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

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

[6]  Jason Cong,et al.  On High-Speed VLSI Interconnects: Analysis and Design , 1992 .

[7]  Vaughn Betz,et al.  Directional bias and non-uniformity in FPGA global routing architectures , 1996, Proceedings of International Conference on Computer Aided Design.

[8]  A. M. Geoffrion Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[9]  S. M. Shahidehpour,et al.  Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation , 1995 .

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

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

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

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

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

[15]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[16]  Ieee Circuits,et al.  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems information for authors , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  P. Luh,et al.  Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling , 1995 .

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

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

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

[21]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[22]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..