Non-tree routing for reliability and yield improvement

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

Volumn , Issue , 2002, Pages 260-266

  Kahng, Andrew B ^a   Liu, Bao ^a   Mǎndoiu, Ion I ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MANHATTAN ROUTING TREE AUGMENTATION; OPEN FAULTS; REDUNDANT INTERCONNECTS;

COMPUTER SIMULATION; FAILURE ANALYSIS; GENETIC ALGORITHMS; OPTIMIZATION; PROBABILITY; RELIABILITY; RESPONSE TIME (COMPUTER SYSTEMS); TREES (MATHEMATICS);

INTEGRATED CIRCUIT LAYOUT;

EID: 0036907068     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/774572.774611     Document Type: Conference Paper

References (16)

1. M. Borah, R. M. Owens, and M. J. Irwin. A fast and simple Steiner routing heuristic. Discrete Applied Mathematics, 90:51-67, 1999.
2. V.K.R. Chiluvuri. Yield optimization in physical design: a review. In Proceedings of the Fifth ACM/SIGDA Physical Design Workshop, pages 198-206, 1996.
3. J. P. de Gyvez. Yield modeling and beol fundamentals. In Proceedings of 2001 International Workshop on System-Level Interconnect Predition, pages 135-163, 2001.
4. K.P. Eswaran and R.E. Tarjan. Augmentation problems. SIAM Journal on Computing, 5:653-665, 1976.
5. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Second edition. Springer-Verlag, Berlin, 1993.
6. M. Grötschel, C.L. Monma, and M.Stoer. Design of survivable networks. In Handbooks in Operations Research and Management Science, vol. 7: Network Models, pages 617-672, Amsterdam, 1995. North-Holland.
7. T.-S. Hsu. Graph augmentation and related problems: theory and practice. PhD thesis, University of Texas at Austin, 1993.
8. http://www-device.eecs.berkeley.edu/~ptm/.
9. S. Khuller, B. Raghavachari, and A. Zhu. A uniform framework for approximating weighted connectivity problems. In Proc. 10th ACM-SIAM Annual Symposium on Discrete Algorithms, 1999.
10. J. Lillis, C.-K. Cheng, T.-T. Y. Lin, and C.-Y. Ho. New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing. In ACM/IEEE Design Automation Conference, pages 395-400, 1996.
11. B. A. McCoy and G. Robins. Non-tree routing. IEEE Transactions on Computer-Aided Design, 14(6):790-784, June 1995.
12. M. Orshansky. Personal Communication. April 2002.
13. M. Orshansky, L. Milor, P. Chen, K. Keutzer, and C. Hu. Impact of systematic spatial intra-chip gate length variability on performance of high-speed digital circuits. In IEEE-ACM International Conference on Computer-Aided Design, pages 62-67, 2000.
14. G. R. Raidl and I. Ljubic. Evolutionary local search for the edge-biconnectivity augmentation problem. Information Processing Letters, 82:39-45, 2002.
15. S.-C. Wong, G.-Y. Lee, and D.-J. Ma. Modeling of interconnect capacitance, delay, and crosstalk in vlsi. IEEE Trans. on Semiconductor Manufacturing, 13(1):753-782, 2000.
16. T. Xue and E. S. Kuh. Post routing performance optimization via multi-link insertion and non-uniform wiresizin. In IEEE-ACM International Conference on Computer-Aided Design, pages 575-580, 1995.