A General Greedy Channel Routing Algorithm

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

Volumn 10, Issue 2, 1991, Pages 204-211

  Ho, Tai Tsung ^a   Iyengar, S Sitharama ^a   Zheng, Si Qing ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

backtracking; Channel routing algorithm; data structure; Manhattan model

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL TECHNIQUES--HEURISTIC; SYSTEMS SCIENCE AND CYBERNETICS--HEURISTIC PROGRAMMING;

BURSTEIN DIFFICULT PROBLEM; CHANNEL ROUTING; DEUTSCH DIFFICULT PROBLEM; ROUTING ALGORITHMS;

INTEGRATED CIRCUITS;

EID: 0026103862     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.68407     Document Type: Article

References (29)

1. A. Hashimoto A. and J. Stevens, “Wiring routing by optimizing channel assignment within large apertures,” in Proc. 8th Design Automation Workshop, 1971, pp. 155–169.
2. B. W. Kernighan D. G. Schweikert, and G. Persky, “An optimal channel routing algorithm for polycell layouts of integrated circuits,” in Proc. 10th Design Automation Workshop, 1973, pp. 50–59.
3. David N. Deutsch, “A dogleg channel router,” in Proc. 13th Design Automation Conf., 1976, pp. 425–433.
4. R. L. Rivest and C. M. Fiduccia, “A greedy channel router,” in Proc. 19th Design Automation Conf., 1982, pp. 418–424.
5. R. J. Enbody and H. C. Du, “General purpose router,” in Proc. 24th ACM/IEEE Design Automation Conf., 1987, pp. 637–640.
6. Y. Takeshi and E. S. Kuh, “Efficient algorithm for channel routing,” IEEE Trans. Computer-Aided Design, vol. CAD-1, pp. 298–307, Jan. 1982.
7. M. Burstein and R. Pelavin, “Hierarchical channel router,” in Proc. 20th Design Automation Conf., 1983, pp. 591–597.
8. J. Reed, A. Sangiovanni-Vincentelli, and M. Santomauro, “A new symbolic channel router: YACR2,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 208–219, July 1985.
9. M. R. Edward, N. Jury, and D. Narsing, Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: Prentice Hall, 1977.
10. M. Burstein and R. Pelavin, “Hierarchical wire routing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 223–234, Oct. 1983.
11. D. J. Brown and R. L. Rivest, “New lower bounds for channel width,” in Proc. CMU Conf. on VLSI Systems and Computations, 1981, pp. 178–185.
12. H. Shin and A. Sangiovanni-Vincentelli, “MIGHTY: ‘Rip-up and reroute' detailed router,” in Proc. Int. Conf. on CAD, Nov. 1986, pp. 2–5.
13. G. T. Hamachi and J. K. Ousterhout, “A switch-box router with obstacle avoidance,” in Proc. 21st Design Automation Conf., June 1984, pp. 173–179.
14. Y. Hsieh and C. Chang, “A modified detour router,” in Proc. Int. Conf. on CAD, Nov. 1985, pp. 301–303.
15. R. L. Rivest, A. E. Baratz, and G. Miller, “Probably good channel routing algorithm,” in Proc. CMU Conf. on VLSI Systems and Computations, 1981, pp. 153–159.
16. T. Bolognesi and D. J. Brown, “A channel routing algorithm with bounded wire length,” unpublished manuscript, Coordinated Science Lab., University of Illinois at Urbana-Champaign, 1982.
17. T. G. Szymanski, “Dogleg channel routing Is NP -complete,” IEEE Trans. Computer-Aided Design, vol. CAD-4, pp. 31–40, 1985.
18. D. S. Johnson, “The NP-completeness column: An ongoing guide,” J. Algorithms, vol. 3, pp. 381–395, 1983.
19. S. Sahni and A. Bhatt, “The complexity of design automation problems,” in Proc. 17th Design Automation Conf, 1980, pp. 402–411.
20. M. L. Brady and D. J. Brown, “VLSI routing: Four layers suffice,” Advances Comput. Res., vol. 2, 1984.
21. W. Lipski, Jr., “An NP-complete problem related to three-layer channel routing,” Advances Comput. Res., vol. 2, 1984.
22. W. Lipski, Jr. and F. P. Preparata, “An unified approach to layout wirability,” Mathematic. Syst. Theory, vol. 19, 1987.
23. K. Mehlhorn and F. P. Preparata, “Routing through a rectangle,” J. ACM., vol. 33, no. 1, 1986.
24. F. P. Preparata and W. Lipski, Jr., “Optimal three-layer channel routing,” IEEE Trans. Comput., vol. C-33, p. 5, 1984.
25. T. T. Ho, S. S. Iyengar, and S. Q. Zheng, “A new channel routing algorithm,” Tech. Rep. #88-055, Louisiana State Univ., 1988.
26. “Density-based general greedy channel routing,” Tech. Rep. #89-014, Louisiana State Univ., 1989.
27. T. T. Ho and S. S. Iyengar, “A density-based three-layer router,” Tech. Rep. #89-015, Louisiana State Univ., 1989.
28. T. T. Ho, “A density-based general greedy channel routing algorithm in VLSI design automation,” Ph.D. dissertation, Louisiana State Univ., Aug. 1989.
29. Y. L. Lin, Y. C. Hsu, and F. S. Tsai, “SILK: A simulated evolution router,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 1108–1114, Oct. 1988.