Length-matching routing for high-speed printed circuit boards

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2003, Pages 394-400

  Ozdal, Muhammet Mustafa ^a   Wong, Martin D F ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; FREQUENCIES; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; PRINTED CIRCUIT BOARDS; PROBLEM SOLVING; VLSI CIRCUITS;

CLOCK FREQUENCIES; ROUTING ALGORITHMS;

ROUTERS;

EID: 0347409193     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccad.2003.159717     Document Type: Conference Paper

References (18)

1. V. Betz and J. Rose. Directional bias and non-uniformity in FPGA global routing architectures. In Proc. of ICCAD, pages 652-659, 1996.
2. V. Betz and J. Rose. Vpr: A new packing, placement and routing tool for FPGA research. In Proc. of the 7th International Workshop on Field-Programmable Logic, pages 213-222, 1997.
3. K. D. Boese, J. Cong, A. B. Kahng, K. S. Leung, and D. Zhou. On highspeed VLSI interconnects: Analysis and design. In Proc. Asia-Pacific Conf. Circuits Syst., pages 35-40, 1992.
4. J. Cong, A. B. Kahng, G. Robins, M. Sarrafzadeh, and C. K. Wong. Provably good performance-driven global routing. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 11(6):739-752, 1992.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1992.
6. A. E. Dunlop, V. D. Agrawal, D. N. Deutsch, M. F. Jukl, P. Kozak, and M. Wiesel. Chip layout optimization using critical path weighting. In Proc. of Design Automation Conference, pages 133-136, 1984.
7. C. Ebeling, L. McMurchie, S. A. Hauck, and S. Bums. Placement and routing tools for the triptych FPGA. IEEE Trans. on VLSI, pages 473-482, 1995.
8. M. L. Fisher. The Lagrangian relaxation method for solving integer programming problems. Management Science, 27(1):1-18, 1981.
9. M. L. Fisher. An applications oriented guide to Lagrangian relaxation. Interfaces, 15(2):10-21, 1985.
10. A. M. Geoffrion. Lagrangian relaxation and its uses in integer programming. Mathematical Programming, 2:82-114, 1974.
11. X. Guan, P. B. Luh, and L. Zhang. Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling. IEEE Transactions on Power Systems, 10(2):772-778, 1995.
12. X. H. Guan, Q. Z. Zhai, and F. Lai. New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems. Journal of Optimization Theory and Applications, 113(1):65-82, 2002.
13. M. H. Held, P. Wolfe, and H. D. Crowder. Validation of subgradient optimization. Mathematical Programming, 6(1):62-88, 1974.
14. E. Kuh, M. A. B. Jackson, and M. Marek-Sadowska. Timing-driven routing for building block layout. In Proc. IEEE Intl. Symposium on Circuits and Systems, pages 518-519, 1987.
15. S. Prastjutrakul and W. J. Kubitz. A timing-driven global router for custom chip design. In Proc. of IEEE Intl. Conf. on Computer-Aided Design, pages 48-51, 1990.
16. A. Renaud. Daily generation management at electricite de france: Form planning toward real time. IEEE Transactions on Automatic Control, 38(7):1080-1093, 1993.
17. L. W. Ritchey. Busses: What are they and how do they work? Printed Circuit Design Magazine, 2000.
18. S. J. Wang, S. M. Shahidehpour, D. S. Kirschen, S. Mokhtari, and G. D. Irisari. Short-term generation scheduling with transmission constraints using augmented Lagrangian relaxation. IEEE Trans. on Power Systems, 10(3):1294-1301, 1995.