Parallel Global Routing for Standard Cells

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 9, Issue 10, 1990, Pages 1085-1095

  Rose, Jonathan ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING;

GENERAL-PURPOSE MULTIPROCESSORS; ROUTING ALGORITHMS; SPEEDUPS;

INTEGRATED CIRCUITS, VLSI;

EID: 0025507460     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.62733     Document Type: Article

References (36)

1. H. G. Adshead, “Employing a distributed array processor in a dedicated gate array layout system,” in Proc. ICCC, Sept. 1982, pp. 411– 414.
2. S. B. Akers, Design Automation of Digital Systems; Theory and Techniques, M. A. Breuer, Ed. Englewood Clilïs, NJ: Prentice-Hall. 1972. chap. 6.
3. P. Banerjee and M. Jones, “A parallel simulated annealing algorithm for standard cell placement on a hypercube computer,” in Proc: ICCAD 86, Nov. 1986, pp. 34–37.
4. T. Blank. M. Stefik. and W. VanCleemput, “A parallel bit map processor architecture for DA algorithms,” in Proc. 18th Design Automation Conf., June 1981. pp. 837–845.
5. M. A. Breuer, “Min-cut placement.” J. Design Automat. Fault-Tolerant Comput., pp. 343–362, Oct. 1977.
6. M. A. Breuer and K. Shamsa, “A hardware router,” J. Digital Sxst., vol. IV. no. 4. pp. 393–408, 1981.
7. M. Burstein and S. J. Hong, “Hierarchical VLSI layout: Simultaneous placement and wiring of gate arrays,” in Proc VLSI '83, 1983. pp. 45–60.
8. A. Casotto. F. Romeo, and A. Sangiovanni-Vincentelli. “A parallel simulated annealing algorithm for the placement of macro-cells,” in Proc. 1CCAD 86, Nov. 1986, pp. 30–33.
9. —, “A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells,” IEEE Trans. Computer-Aided Design, vol. 6, pp. 838–847, Sept. 1987.
10. J. Cong and B. Preas, “A new algorithm for standard cell global routing,” in Proc ICCAD 88, Nov. 1988, pp. 176–179.
11. W-M. Dai and E. S. Kuh, “Simultaneous floorplanning and global routing for hierarchical building-block layout,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 828–837, Sept. 1987.
12. A. Iosupovici, “A class of array architectures for hardware grid routers,” IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 245– 255, Apr. 1986.
13. T. Kambe, T. Okada, T. Chiba, and 1. Nishioka, “A global routing scheme for polycell LSI,” in Proc: ISCAS, 1985. pp. 187–190.
14. J. B. Kruskal, “On the shortest spanning subtree of a graph and the traveling salesman problem.” in Proc Amer. Math. Soc, vol. 7, 1956, pp. 48–50.
15. C. Y. Lee, “An algorithm for path connections and its applications.” IRE Trans. Electron. Comput., vol. EC-10. pp. 346–365, 1961.
16. K-W. Lee and C. Sechen, “A new global router for row-based layout,” in Proc: ICCAD 88, Nov. 1988, pp. 180–183.
17. M. J. Lorenzetti and D. S. Baeder. “Routing,” in Physical Design Automation of VLSI Systems, B. Preas and M. Lorenzetti, Ed. Menlo Park, CA: Benjamin/Cummings, 1988, chap. 5.
18. R. Nair, S. J. Hong, S. Liles, and R. Villani, “Global wiring on a wire routing machine,” in Proc 19th Design Automation Conf., pp. 224–231. June 1982.
19. R. Nair, “A simple yet effective technique for global wiring,” IEEE Trans. Computer-Aided Design, vol. CAD-6. pp. 165–172. Mar. 1987.
20. A. P.-C. Ng. P. Raghavan, and C. D. Thompson, “A language for describing rectilinear Steiner tree configurations.” in Proc 23rd Design Automation Conf., pp. 659–662, June 1986.
21. A. M. Patel, N. L. Soong. and R. K. Korn. “Hierarchical VLSI Routing—An approximate routing procedure.” IEEE Trans. Computer-Aided Design, vol. CAD-4. pp. 121–126, Apr. 1985.
22. B. T. Preas. “Benchmarks for cell-based layout systems.” in Proc 24rd Design Automation Conf. June 1987, pp. 319–320.
23. —, private communication.
24. R. Prim. “Shortest connecting networks and some generalizations.” Bell. Syst. Tech. J., vol. 36. pp. 1389–1401, 1957.
25. J. S. Rose. W. M. Snelgrove. and Z. G. Vranesic. “ALTOR: An automatic standard cell layout program,” in Proc Canadian Conf. on VLSI, Nov. 1985, pp. 168–173.
26. J. S. Rose, D. R. Blythe, W. M. Snelgrove, and Z. G. Vranesic, “Fast, high quality VLSI placement on an MIMD multiprocessor.” in Proc ICCAD 86. Nov. 1986. pp. 42–45.
27. J. S. Rose. W. M. Snelgrove. and Z. G. Vranesic, “Parallel standard cell placement algorithms with quality equivalent to simulated annealing.” IEEE Trans. Computer-Aided Design, vol. 7. pp. 387–396. Mar. 1988.
28. J. S. Rose. “LocusRoute: A parallel global router for standard cells.” in Proc 25th Design Automation Conf., June 1988. pp. 189–195.
29. F. Rubin, “The Lee path connection algorithm,” IEEE Trans. Comput., vol. C-23, pp. 907–914. Sept. 1974.
30. R. A. Rutenbar, T. N. Mudge. and D. E. Atkins, “A class of cellular architectures to support physical design automation,” IEEE Trans. Computer-Aided Design, vol. CAD-3, pp. 264–278, Oct. 1984.
31. C. Sechen and A. Sangiovanni-Vincentelli, “The Timberwolf placement and routing package,” IEEE J. Solid-State Circuits, vol. SC-20, pp. 510–522, Apr. 1985.
32. C. Sechen, D. Braun, and A. Sangiovanni-Vincentelli, “Thunder-Bird: A complete standard cell layout package.” IEEE J. Solid-Slate Circuits, vol. 23, pp. 410–420, Apr. 1988.
33. P. R. Suaris and G. Kedem. “A quadrisection based combined place and route scheme for standard cells.” IEEE Trans. Computer-Aided Design, vol. 8. pp. 234–244. Mar. 1989.
34. K. Supowit, “Reducing channel density in standard cell layout,” in Proc 20th Design Automation Conf., June 1983, pp. 263–269.
35. Y. Won. S. Sahni. and Y. El-Ziq, “A hardware accelerator for maze routing.” in Proc 24th Design Automation Conf., June 1987. pp. 800–806.
36. M. Yamada, T. Hiwatashi. T. Mitsuhashi, and K. Yoshida, “A multilayer router for standard cell LSIs,” in Proc ISCAS. 1985, pp. 191–194.