A polynomial time approximation scheme for timing constrained minimum cost layer assignment

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

Volumn , Issue , 2008, Pages 112-115

  Hu, Shiyan ^a   Li, Zhuo ^b   Alpert, Charles J ^b  

^a Michigan Technological University   (United States)

^b IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADVANCED TECHNOLOGIES; CIRCUIT PERFORMANCES; COMPLETE PROBLEMS; GATE DELAYS; INTERCONNECT DELAYS; LAYER ASSIGNMENTS; METAL LAYERS; MINIMUM COSTS; NANOSCALE REGIMES; NEW ALGORITHMS; NEW DIMENSIONS; NUMBER OF NODES; OPTIMAL DYNAMICS; OPTIMAL LAYERS; POLYNOMIAL TIME APPROXIMATION SCHEMES; ROUTING LAYERS; THIN METALS; TIMING CONSTRAINTS; VLSI TECHNOLOGIES; WIRE SIZINGS;

ARSENIC; COMPUTER AIDED DESIGN; METALS; NANOTECHNOLOGY; ROUTING ALGORITHMS; SYSTEMS ENGINEERING; TIME MEASUREMENT; TIMING CIRCUITS; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS); WIRE; WIRELESS TELECOMMUNICATION SYSTEMS;

POLYNOMIAL APPROXIMATION;

EID: 57849083934     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2008.4681560     Document Type: Conference Paper

References (15)

1. Z. Li, C. Alpert, S. Hu, T. Muhmud, S. Quay, and P. Villarrubia, "Fast interconnect synthesis with layer assignment," ISPD, 2008.
2. J. Fishburn and C. Schevon, "Shaping a distributed-rc line to minimize elmore delay," IEEE Trans. on Circuits and Systems-I, vol. 42, no. 12, pp. 1020-1022, 1995.
3. C.-P. Chen, C. Chu, and D. Wong, "Fast and exact simultaneous gate and wire sizing by lagrangian relaxation," IEEE Transactions on Computer-Aided Design, vol. 18, no. 7, pp. 1014-1025, 1999.
4. J. Cong, K.-S. Leung, and D. Zhou, "Performance-driven interconnect design based on distributed rc delay model," DAC, pp. 606-611, 1993.
5. J. Cong and K.-S. Leung, "Optimal wire sizing under elmore delay model," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 3, pp. 321-336, 1995.
6. C. Alpert, A. Devgan, J. P. Fishburn, and S. T. Quay, "Interconnect synthesis without wire tapering," IEEE Transactions on Computer-Aided Design, vol. 20, no. 1, pp. 90-104, 2001.
7. J. Lillis and C.-K. Cheng and T.-T.Y. Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model," IEEE Journal of Solid State Circuits, vol. 31, no. 3, pp. 437-447, 1996.
8. C. Alpert, S. Karandikar, Z. Li, G.-J. Nam, S. Quay, H.Ren, C. Sze, P. Villarrubia, and M. Yildiz, "Techniques for fast physical synthesis," Proceedings of IEEE, vol. 95, no. 3, pp. 573-599, 2007.
9. R. Hassin, "Approximation, schemes for the restricted shortest path problem," Mathematics of Operations Research, vol. 17, no. 1, pp. 36-42, 1992.
10. M. Marek-Sadowska, "An unconstrained topological via minimization problem for two-layer routing," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 3, no. 3, pp. 184-190, 1984.
11. S. Hu, C. J. Alpert, J. Hu, S. Karandikar, Z." Li, W. Shi, and C. N. Sze, "Fast algorithms for slew constrained minimum cost buffering," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 11, pp. 2009-2022, 2007.
12. 2) time algorithm, for optimal buffer insertion with b buffer types," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 25, no. 3, pp. 484-489, 2006.
13. W. Shi, Z. Li and C. J. Alpert, "Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost," ASPDAC, pp. 609-614, 2004.
14. M. Garey and D. Johnson, "Computers and intractability: A guide to the theory of np-completeness," 1979.
15. G. Xue, W. Zhang, J. Tang, and K. Thulasiraman, "Polynomial time approximation algorithms for multi-constrained qos routing," IEEE/ACM Transactions on Networking, vol. 16, no. 3, pp. 656-669, 2008.