Incremental CAD

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

Volumn 2000-January, Issue , 2000, Pages 236-243

  Coudert, Olivier ^a   Cong, Jason ^b   Malik, Sharad ^c   Sarrafzadeh, Majid ^d  

^a Monterey Design Systems   (United States)

^b University of California   (United States)

^c Princeton University   (United States)

^d Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DESIGN; LOGIC DESIGN; LOGIC SYNTHESIS; SYNTHESIS (CHEMICAL); ERROR CORRECTION; ESTIMATION; FIELD PROGRAMMABLE GATE ARRAYS; ITERATIVE METHODS;

CAD TOOL; DESIGN QUALITY; INCREMENTAL ALGORITHM; INCREMENTAL CHANGES; LOCAL ERROR; PHYSICAL DESIGN;

COMPUTER AIDED DESIGN;

BACK TRACKING; CHECK POINT MANAGEMENT; ITERATIVE ALGORITHMS; LOCAL CHANGES;

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

References (57)

1. M.H. Arnold and W.S. Scott. An interactive maze router with hints. In Proc. 25th Design Automation Conference, pages 672-676, Jun 1988.
2. D. Brand, A. Drumm, S. Mundu, and P. Narain. "Incremental Synthesis". In Proceedings of the International Conference on Computer-Aided. Design, pages 14-18. IEEE, November 1994.
3. D. Brand, Anthony Drumm, Sandip Kundu, and Prakash Narain. Incremental synthesis. In IEEE International Conference on Computer-Aided Design, 1994.
4. C.-S. Choy, T.-S. Cheung, and K.-K. Wong. "Incremental Layout Placement Modification Algorithms". IEEE transactions on Computer Aided Design, 15(4):437-445, April 1996.
5. J. Cong, J. Fang, and K.Y. Khoo. An implicit connection graph maze routing algorithm for ECO routing. In Proc. ACM/IEEE International Conference on Computer Aided Design, pages 163-167, Nov 1999.
6. J. Cong, J. Fang, and K.Y. Khoo. Via design rule consideration in multi-layer maze routing algorithms. In Proc. International Symposium on Physical Design, pages 214-220, Apr 1999.
7. J. Cong and L. He. Theory and algorithm of local- refinement-based optimization with application to device and interconnect sizing. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pages 406-420, 1999.
8. J. Cong and H. Huang. Technology mapping for field programmable gate arrays with incremental changes. In IEEE-ACM Design Automation Conference, pages 290-293, 2000.
9. J. Cong, C.-K. Koh, and P. Madden. Performance optimization of VLSI interconnect layout. Intergration, the VLSI Journal, 21(1-2):1-94, .
10. J. Cong and Majid Sarrafzadeh. "Incremental Physical Design". In International Symposium on Physical Design, pages 84-92, 2000.
11. Olivier Coudert. Gate sizing for constrained delay/power/area optimization, pages 465-472, December 1997.
12. J. Crenshaw, M. Sarrafzadeh, P. Banerjee, and P. Prabhakaran. "An Incremental Floorplanner". In Great Lakes Symposium on VLSI, March 1999.
13. H Edelsbrunner. A new approach to rectangle intersections. Intl. Journal of Computer Mathematics, 13(3- 4):209-229, 1983.
14. J.M. Emmert and D. Bhatia. "Incremental Routing in FPGAs". In IEEE International ASIC Conference and Exhibit, 1998.
15. J. P. Fishburn and A. E. Dunlop. TILOS: A posyno- mial programming approach to transistor sizing. In IEEE International Conference on Computer-Aided Design, pages 326-328, 1985.
16. J. Grodstein, E. Lehman, H. Harkness, B. Grundmann, and Y. Watanabe. A delay model for logic synthesis of continuously-sized networks. In IEEE International Conference on Computer-Aided Design, 1995.
17. Gary D. Hachtel and Fabio Somenzi. Logic Synthesis and Verification Algorithms. Kluwer Academic Publishers, 1996.
18. R. Haddad, L. P. P. P. van Ginneken, and N. Shenoy. Discrete drive selection for continuous sizing. In IEEE International Conference on Computer Design, 1997.
19. F.O. Hadlock. A shortest path algorithm for grid graphs. Networks, 7(4):323-334, 1977.
20. A Hetzel. A sequential detailed router for huge grid graphs. In Proc. Design Automation and Test in Europe, pages 332-338, Feb 1998.
21. J. Hu and S. S. Sapatnekax. Simultaneous buffer insertion and non-Hanan optimization for VLSI interconnect under a higher order AWE model. In International Symposium on Physical Design, 1999.
22. J. Fang J. Cong and K.Y. Khoo. DUNE: A multi-layer gridless routing system with wire planning. In Proc. International Symposium on Physical Design, 2000.
23. Y. Jiang, S. S. Sapatnekar, C. Bamji, and J. Kim. Interleaving buffer insertion and transistor sizing into a single optimization. December 1998.
24. A.B. Kahng and S. Mantik. "Mismatches of Incremental Optimizers and Instance Perturbations in Current Place-and-Route Tools". In Proceedings of International Conference on Computer-Aided Design, 2000.
25. Kato, S. Ohhira, and Y. Hisatomi. A method of pattern data management of PWB layout system. In Proc. 35th Annual Convention IPS Japan, pages 24292430, 1987.
26. K. Kawamura, T. Shindo, T. Shibuya, H. Miwatari, and Y. Ohki. Touch and cross router. In Proc. of IEEE Conference on Computer-Aided Design, pages 56-59, Nov 1990.
27. E.S. Kuh and T. Ohtsuki. Recent advances in VLSI layout. Proc. of the IEEE, 78(2):237-263, Feb 1990.
28. C.Y. Lee. An algorithm for path connections and its applications. IRE Trans Electronic Computers, EC- 10:346-365, 1961.
29. Y.-L. Lin, Y.-C. Hsu, and F.-S. Tsai. Silk: A simulated evolution router. IEEE Transactions on Computer- Aided Design, 8(10), Oct 1989.
30. L.-C. Liu, H.-P. Tseng, and C. Sechen. Chip-level area routing. In Proc. of Interational Symposium on Physical Design, pages 197-204, Apr 1998.
31. J. Jess, M. Berkelaar. Gate sizing in mos digital circuits with linear programming, pages 217-221, 1990.
32. K. Eguro M. Wang, X. Yang and M. Sarrafzadeh. "Multi-center Congestion Estimation and Minimization During Placement". In International Symposium on Physical Design, 2000.
33. X. Yang , M.Wangand, M. Sarrafzadeh. "DRAGON2000: A Fast Standard- Cell Placement Tool". In Proceedings of International Conference on Computer-Aided Design, 2000.
34. A. Margarino, A. Romano, A. De Gloria, F. Cu- ratelli, and P. Antognetti. A tile-expansion router. IEEE Trans. Computer-Aided Design, CAD-6(4):507- 517, Jul 1987.
35. L. McMurchie and C. Ebeling. Pathfinder: A negotiation-based performance-driven router for FP- GAs. In Proc. of ACM Symposium, on Field- Programmable Gate Array, pages 111-117, Feb 1995.
36. S. Manne O. Coudert, R. Haddad. New algorithms for gate sizing: A comparative study. In IEEE-ACM Design Automation Conference, pages 197-202, 1996.
37. T. Ohtsuki. Gridless routers - new wire routing algorithms based on computational geometry. In Proc. International Conference of Circuits and Systems, 1985.
38. T. Okamoto and J. Cong. Interconnect layout optimization by simultaneous steiner tree construction and buffer insertion. In International Symposium on Physical Design, 1996.
39. J.K. Ousterhout. Corner stitching: A data-structuring technique for VLSI layout tools. IEEE Trans. Computer-Aided Design, CAD-3(1):87-100, Jan 1984.
40. J.K. Ousterhout, G.T. Hamachi, R.N. Mayo, W.S. Scott, and G.S. Taylor. Magic: A VLSI layout system. In Proc. 21st Design Automaton Conference, pages 152-159, Jun 1984.
41. M. Pedram and N. Bhat. Layout driven logic restructuring and decomposition. In IEEE International Conference on Computer-Aided Design, 1991.
42. M. Pedram and N. Bhat. Layout driven technology mapping. In IEEE-ACM Design Automation Conference, 1991.
43. S. Raman, C.L. Liu, and L.G. Jones. "A Timing Constrained Incremental Routing Algorithm for Symmetrical FPGAs". In European Design and Test Conference, 1996.
44. P. M. Vaidya, S. S. Sapatnekar, V. B. Rao and S. M. Kang. An exact solution to the transistor sizing problem for cmos circuits using convex optimization, pages 1621-1634, December 1993.
45. A. Salek, J. Lou, and M. Pedram. A simultaneous routing tree construction and fanout optimization algorithm. In IEEE International Conference on Computer-Aided Design, 1998.
46. M. Sato, J. Sakanaka, and T. Ohtsuki. A fast line- search method based on a tile plane. In IEEE International Symposium on Circuits and Systems, pages 588-591, May 1987.
47. J. Soukup. Fast maze router. In Proc. 15th Design Automation Conference, pages 100-102, 1978.
48. R. F. Sproull and I. E. Sutherland. Logical effort: Designing for speed on the back of an envelope. In Proceedings of the IEEE Advanced Research in VLSI Conference, 1991.
49. L. Stok, D.S. Kung, D. Brand, A.D. Drumm, A.J. Sullivan, L.N. Reddy, N. Hieter, D.J. Geiger, H. Chao, and P.J. Osier. "BooleDozer: Logic Synthesis for ASICs". IBM Journal of Research and Development, 40(4) :407- 430, July 1996.
50. G. Swamy, S. Rajamani, C. Lennaxd, and R.K. Bray- Ton. "Minimal Logic Resynthesis for Engineering Change". In International Symposium on Physical Design, pages 1596-1599. IEEE, 1997.
51. H. J. Touati. Performance Oriented Technology Mapping. PhD thesis, University of California, Berkeley, 1990.
52. Lukas P. P. P. van Ginneken. Buffer placement in distributed RC-tree networks for minimal Elmore delay. In IEEE International Symposium on Circuits and Systems, 1990.
53. M. Wang and M. Sarrafzadeh. "Behavior of Congestion Minimization During Placement". In International Symposium on Physical Design, pages 145-150. ACM, April 1999.
54. P. Widmayer. On graphs preserving rectilinear shortest paths in the presence of obstacles. Annals of Operations Research, 33(1-4):557-75, Dec 1991.
55. Y.F. Wu, P. Widmayer, M.D.F Schlag, and C.K. Wong. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles. IEEE Trans. Computers, C-36(3):321-331, Mar 1987.
56. S.Q. Zheng, Joon Shink Lim, and S.S. Iyengar. Finding obstacle-avoiding shortest paths using implicit connection graphs. IEEE Trans. Computer-Aided Design, 15(1):103-110, Jan 1996.
57. Hai Zhou, Martin Wong, I-Min Liu, and Adnan Aziz. Simultaneous routing and buffer insertion with restrictions on buffer locations. In IEEE-ACM Design Automation Conference, 1999.