Fast integer linear programming based models for VLSI global routing

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn , Issue , 2005, Pages 6238-6243

  Behjat, Laleh ^a   Chiang, Andy ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL OPTIMIZATION TECHNIQUES; GLOBAL ROUTERS; GLOBAL ROUTING; GLOBAL VIEW; INTEGER LINEAR PROGRAMMING; ROUTINGS; SOLUTION TIME; SUBOPTIMAL SOLUTION; TREE PRUNING; VLSI PHYSICAL DESIGN; WIRELENGTH MINIMIZATION;

CHANNEL CAPACITY; DYNAMIC PROGRAMMING; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; LINEARIZATION; OPTIMIZATION; ROUTING ALGORITHMS;

PROBLEM SOLVING;

EID: 33845663186     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.2005.1466066     Document Type: Conference Paper

References (16)

1. N. Sherwani, Algorithms for VLSI physical design automation. The Netherlands: Kluwer Publishers, 1999.
2. E. Bozorgzadeh, R. Kastner, and M. Sarrafzadeh, "Creating and exploiting flexibility in rectilinear steiner trees," IEEE Transactions on Computer-Aided Design of Circuits and Systems, vol. 22, pp. 605- 615, 2003.
3. Y. Chang and S. Lin, "MR: a new framework for multilevel full-chip routing," IEEE Transactions on Computer-Aided Design of Circuits and Systems, vol. 23, pp. 793-800, 2004.
4. L. E. Liu and C. Sechen, "Multilayer chip-level global routing using an efficient graph-based steiner tree heuristic," IEEE Transactions on Computer-Aided Design of Circuits and Systems, vol. 18, no. 10, pp. 1442-1451, 1999.
5. R. Nair, "A simple yet effective technique for global wiring," IEEE Transactions on Computer-Aided Design of Circuits and Systems, vol. 6, pp. 165-172, 1987.
6. L. Behjat and A. Vannelli, "Steiner tree construction based on congestion for the global routing problem," in proceeding of 3rd IEEE WSoC, 2003,pp. 28-31.
7. R. C. Carden, J. Li, and C. Cheng, "Creating and exploiting flexibility in rectilinear Steiner trees," IEEE Transactions on Computer-Aided Design of Circuits and Systems, vol. 15, pp. 208- 216, 1996.
8. T. Jing, X.-L. Hong, J.-Y. Xu, H.-Y. Bao, C.-K. Cheng, and J. Gu, "UTACO: a unified timing and congestion optimization algorithm for standard cell global routing," IEEE Transactions on Computer-Aided Design of Circuits and Systems, vol. 23, pp. 358-365, 2004.
9. T. Lengauer and M. Lungering, "Provably good global routing of integrated circuits," SIAM Journal of Optimization, vol. 11, no. 1, pp. 1-30, 2000.
10. A. Vannelli, "An adaptation of the interior point method for solving the global routing problem," IEEE Transactions on Computer-Aided Design of Circuits and Systems, vol. 10, no. 2, 1991.
11. N. Karmarkar, "A new polynomial-time algorithm for linear programming," Combinatorica, vol. 4, no. 4, pp. 373-395, 1984.
12. P. Raghavan and C. D. Thompson, "Multi-terminal global routing: A deterministic approximation scheme," Algorithmica, vol. 6, pp. 73-82,1991.
13. "Ibm-place 2.0 benchmark suits, http://er.cs.ucla.edu/benchmarks/ ibmplace2/," Website, http://er.cs.ucla.edu/benchmarks/ibm-place2/.
14. D. M. Warme, "A new exact algorithm for rectilinear steiner trees," in International Symposium on Mathematical Programming, 1997.
15. R. Vanderbei, "LOQO: An interior point code for quadratic programming," Princeton University, Princeton, NJ, Tech. Rep., 1998.
16. M. Wang, X. Yang, and M. Sarrafzadeh, "Dragon2000: Standard-cell placement tool for large industry circuits," in IEEE/ACM International Conference on Compter-Aided Design, 2000, pp. 260-263.