A Simple Yet Effective Technique for Global Wiring

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

Volumn 6, Issue 2, 1987, Pages 165-172

  Nair, Ravi ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - GRAPH THEORY;

MASTER-SLICE CHIP; MAZE-RUNNING TECHNIQUE; WIRING;

INTEGRATED CIRCUITS;

EID: 0023313404     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/TCAD.1987.1270260     Document Type: Article

References (16)

1. K. A. Chen, M. Feuer, K. H. Khokhani, N. Nan, and S. Schmidt, “The chip layout problem: An automatic wiring procedure,” in Proc. 14th Design Automat. Conf. (New Orleans, LA), 1977, pp. 298–302.
2. H. Shiraishi and F. Hirose, “Efficient placement and routing techniques for master-slice LSI,” in Proc. 17th Design Automat. Conf. (San Diego, CA), 1980, pp. 458–464.
3. J. Soukup and J. C. Royle, “On hierarchical routing,” J. Digital Systems, vol. V, no. 3, pp. 265–289, 1981.
4. Z. Syed, A. El Gamal, and M. A. Breuer, “On routing for custom integrated circuits,” in Proc. 19th Design Automat. Conf. (Las Vegas, NV), 1982, pp. 887–893.
5. R. Linsker, “An iterative-improvement penalty-function driven wire routing system,” IBM J. Res. Develop., vol. 28, no. 5, pp. 613–624, 1984.
6. R. Nair, S. J. Hong, S. Liles, and R. Villani, “Global wiring on a wire-routing machine,” in Proc. 19th Design Automat. Conf. (Las Vegas, NV), 1982, pp. 224–231.
7. C. Y. Lee, “An algorithm for path connections and its applications,” IRE Trans. Electron. Comput., vol. EC-10, pp. 346–365, 1961.
8. E. F. Moore, “Shortest path through a maze,” in Annals of the Computation Laboratory. Cambridge, MA: Harvard Univ. Press, 1959, pp. 285–292.
9. W. A. Dees and R. J. Smith, “Performance of interconnection rip-up and reroute strategies,” in Proc. 18th Design Automat. Conf. (Nashville, TN), 1981, pp. 382–390.
10. S. Akers, “Routing,” in Design Automation of Digital Systems: Theory and Techniques, vol. 1, M. A. Breuer, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1972, pp. 283–333.
11. W. E. Donath, “Wire length distributions for placements of computer logic,” IBM J. Res. Develop., vol. 25, no. 3, pp. 152–155, 1981.
12. D. Wallace and L. Hemachandra, “Some properties of a probabilistic model for global wiring,” in Proc. 18th Design Automat. Conf (Nashville, TN), 1981, pp. 660–667.
13. D. T. Lee, S. J. Hong, and C. K. Wong, “Number of vias: A control parameter for global wiring of high density chips,” IBM J. Res. Develop., vol. 25, no. 4, pp. 261–271, 1981.
14. P. S. Hauge and E. J. Yoffa, “Vanguard: A chip physical design system,” in Proc. 23rd Design Automat. Conf. (Las Vegas, NV), 1986, pp. 440–446.
15. E. W. Dijkstra, “A note on two problems in connection with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959.
16. L. S. Woo, C. K. Wong, and D. T. Tang, “PIONEER: A macro-based floor-planning design system,” VLSI Design, vol. VII, no. 8, pp. 32–43, 1986.