A faster approximation scheme for timing driven minimum cost layer assignment

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2009, Pages 167-174

  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

Dynamic programming; Fully polynomial time approximation scheme; Layer assignment; NP Complete; Oracle

Indexed keywords

65-NM NODE; APPROXIMATION BOUNDS; APPROXIMATION SCHEME; CIRCUIT PERFORMANCE; CRITICAL COMPONENT; FAST ALGORITHMS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEME; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; INTERCONNECT DELAY; INTERCONNECT SYNTHESIS; LAYER ASSIGNMENT; MINIMUM COST; NP-COMPLETE; OPTIMAL DYNAMICS; ORACLE; ROUTING LAYERS; ROUTING RESOURCES; THIN METALS; TIME DYNAMIC; TIMING CONSTRAINTS; TIMING-DRIVEN; TREE SIZE; VLSI TECHNOLOGY; WIRE DELAYS;

APPROXIMATION ALGORITHMS; COSTS; DYNAMIC PROGRAMMING; DYNAMICS; METALS; SYSTEMS ENGINEERING; TIME MEASUREMENT; TIMING CIRCUITS; WIRE;

POLYNOMIAL APPROXIMATION;

EID: 70349131994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514932.1514969     Document Type: Conference Paper

References (15)

1. S. Hu, Z. Li, and C. Alpert, "A polynomial time approximation scheme for timing constrained minimum cost layer assignment," in IGGAD, 2008.
2. Z. Li, C. Alpert, S. Hu, T. Muhmud, S. Quay, and P. Villarrubia, "Fast interconnect synthesis with layer assignment," in ISPD, 2008.
3. 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.
4. 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.
5. J. Cong, K.-S. Leung, and D. Zhou, "Performance-driven interconnect design based on distributed rc delay model," in DAG, pp. 606-611, 1993.
6. J. Cong and K.-S. Leung, "Optimal wire sizing under elmore delay model," IEEE Transactions on Computer-Aided Design, vol. 14, no. 3, pp. 321-336, 1995.
7. 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.
8. 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.
9. L.P.P.P. van Ginneken, "Buffer placement in distributed RC-tree networks for minimal Elmore delay," in Proceedings of the IEEE International Symposium, on Circuits and Systems, pp. 865-868, 1990.
10. 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.
11. R. Hassin, "Approximation schemes for the restricted shortest path problem," Mathematics of Operations Research, vol. 17, no. 1, pp. 36-42, 1992.
12. 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 Transactions on Computer-Aided Design, vol. 26, no. 11, pp. 2009-2022, 2007.
13. 2) time algorithm for optimal buffer insertion with b buffer types," IEEE Transactions on Computer-Aided Design, vol. 25, no. 3, pp. 484-489, 2006.
14. W. Shi, Z. Li and C. J. Alpert, "Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost," in ASPDAC, pp. 609-614, 2004.
15. F. Ergun and R. Sinha and L. Zhang, "An improved FPTAS for restricted shortest path," Information Processing Letters, Vol. 83, No. 5, pp. 287-291, 2002.