Near-optimum global routing with coupling, delay bounds, and power consumption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3064, Issue , 2004, Pages 308-324

  Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; ELECTRIC POWER UTILIZATION; POLYNOMIAL APPROXIMATION; TRAFFIC CONTROL; TRAVEL TIME;

CRITICAL PATHS; DELAY BOUND; GLOBAL ROUTING; NEAR OPTIMUM; RANDOMIZED ROUNDING; ROUTING TRAFFIC; THEORETICAL APPROACH;

INTEGER PROGRAMMING;

EID: 35048859722     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25960-2_24     Document Type: Article

References (28)

1. Albrecht, C. [2001a]: Global routing by new approximation algorithms for multicommodity flow. IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems 20 (2001), 622-632
2. Albrecht, C. [2001b]: Zwei kombinatorische Optimierungsprobleme im VLSI-Design: Optimierung der Zykluszeit und der Slackverteilung und globale Verdrahtung. Ph.D. thesis, University of Bonn, 2001
3. Albrecht, C, Korte, B., Schietke, J., and Vygen, J. [2002]: Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discrete Applied Mathematics 123 (2002), 103-127.
4. Carden IV, R.C., Li, J., and Cheng, C.-K. [1996]: A global router with a theoretical bound on the optimum solution. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15 (1996), 208-216
5. Chernoff, H. [1952]: A measure of asymptotic efficiency for tests based on the sum of observations. Annals of Mathematical Statistics 23 (1952), 493-509
6. Erickson, R.E., Monma, C.L., and Veinott jr., A.F. [1987]: Send-and-split method for minimum concave-cost network flows. Mathematics of Operations Research 12 (1987), 634-664
7. FIeischer, L.K. [2000]: Approximating fractional multicommodity flow independent of the number of commodities. SIAM Journal on Discrete Mathematics 13 (2000), 505-520
8. Garg, N., and Könemann, J. [1998]: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (1998), 300-309
9. Grigoriadis, M.D., and Khachiyan, L.G. [1994]: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization 4 (1994), 86-107
10. Grigoriadis, M.D., and Khachiyan, L.G. [1996]: Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research 21 (1996), 321-340
11. Ho, T.-Y., Chang, Y.-W., Chen, S.-J. and Lee, D.-T. [2003]: A fast crosstalk-and performance-driven multilevel routing system. Proceedings of the IEEE International Conference on Computer-Aided Design (Nov. 2003)
12. Hu, J., and Sapatnekar, S.S. [2001]: A survey on multi-net global routing for intergated circuits. Integration, the VLSI Journal 31 (2001), 1-49
13. Jing, T., Hong, X., Bao, H., Cai, Y., Xu, J., Cheng, C., Gu, J. [2003]: Utaco: a unified timing and congestion optimizing algorithm for standard cell global routing. Proceedings of the Asia and South Pacific Design Automation Conference, 2003, 834-839
14. Karakostas, G. [2002]: Faster approximation schemes for fractional multicommodity flow problems. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (2002), 166-173
15. Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., and Vazirani, V.V. [1987]: Global wire routing in two-dimensional arrays. Algorithmica 2 (1987), 113-129
16. Leighton, T., Lu, C.-J., Rao, S., and Srinivasan, A. [2001]: New algorithmic aspects of the Local Lemma with applications to routing and partitioning. SIAM Journal on Computing 31 (2001), 626-641
17. Müller, D. [2002]: Bestimmung der Verdrahtungskapazitäten im Global Routing von VLSI-Chips. Diploma thesis, University of Bonn, 2002
18. Plotkin, S.A., Shmoys, D.B., and Tardos, É. [1995]: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20 (1995), 257-301
19. Raghavan, P. [1986]: Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems. Ph.D. thesis, Report No. UCB/CSD 87/312, University of California, Berkeley 1986
20. Raghavan, P. [1988]: Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences 37 (1988), 130-143
21. Raghavan, P., and Thompson, C.D. [1987]: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987), 365-374
22. Raghavan, P., and Thompson, C.D. [1991]: Multiterminal global routing: a deterministic approximation. Algorithmica 6 (1991), 73-82
23. Roughgarden, T., and Tardos, É. [2000]: How bad is selfish routing? Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (2000), 93-102
24. Schulz, A., and Stier Moses, N. [2003]: Performance of user equilibria in traffic networks. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003), 86-87
25. Shahrokhi, F., and Matula, D.W. [1990]: The maximum concurrent flow problem. Journal of the ACM 37 (1990), 318-334
26. Vygen, J. [1994]: Disjoint paths. Report No. 94816-OR, Research Institute for Discrete Mathematics, University of Bonn, 1994
27. Xu, J., Hong, X., Jing, T., Cai, Y., and Gu, J. [2003]: A novel timing-driven global routing algorithm considering coupling effects for high performance circuit design. Proceedings of the Asia and South Pacific Design Automation Conference, 2003, 847-850
28. Young, N.E. [1995]: Randomized rounding without solving the linear program. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995), 170-178