Hybrid Routing

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

Volumn 9, Issue 2, 1990, Pages 151-157

  Lin, Youn Long ^a   Hsu, Yu Chin ^a   Tsai, Fur Shing ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

General purpose routing; Hierarchical routing; Hybrid routing; Maze routing; VLSI CAD

Indexed keywords

COMPUTER OPERATING SYSTEMS; DATA PROCESSING--DATA STRUCTURES; PRINTED CIRCUITS--COMPUTER AIDED DESIGN;

HIERARCHICAL ROUTING; HYBRID ROUTING; LEE'S ALGORITHM; MAZE-RUNNING ALGORITHM; ULTRIX OPERATING SYSTEM; VLSI CAD;

INTEGRATED CIRCUITS, VLSI;

EID: 0025386015     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.46781     Document Type: Article

References (15)

1. C. Y. Lee, “An algorithm for path connection and its applications,” IRETrans. Electron. Comput., vol. EC-10, pp. 346–365, Sept. 1961.
2. J. P. Cohoon and P. L. Heck, “BEAVER: A computational-geometry-based tool for switchbox routing,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 684–697, June 1988.
3. H. Shin and A. Sangiovanni-Vincentelli, “Mighty, A detailed router based on incremental routing modifications,” IEEE Trans. Computer-Aided Design, vol. CAD-6, pp. 942–955, Nov. 1987.
4. Y-L. Lin, Y-C. Hsu, and F-S. Tsai, “A detailed router based on simulated evolution,” Dig. Papers, Int. Conf. Computer-Aided Design, pp. 38–41, Nov. 1988.
5. J. Soukup, “Fast maze router,” in Proc. 15th Design Automation Conf., pp. 100–102, June 1978.
6. J. H. Hoel, “Some variations of Lee’s algorithm,” IEEE Trans. Comput., vol. C-25, pp. 19–24, Jan. 1976.
7. A. Iosupovici, “A class of array architectures for hardware grid routers, “IEEE Trans. Computer-Aided Design, vol. CAD-5, pp. 245–255. Apr. 1986.
8. T. Ohtsuki, M. Tachibana, and K. Suzuki, “A hardware maze router with rip-up and reroute support,” in Dig. Papers, Int. Conf. Computer-Aided Design, pp. 220–222, Nov. 1985.
9. R. A. Rutenbar, T. N. Mudge, and D. E. Atkins, “Wire routing experiments on a raster pipeline subarray machine,” in Dig. Papers, Int. Conf. Computer-Aided Design, 1983.
10. M. Burstein, and R. Pelavin, “Hierarchical wire routing,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 223–234, Oct. 1983.
11. M. Marek-Sadowska, “Global router for gate array,” in Proc. Int. Conf. Computer Design, pp. 332–337, Oct. 1984.
12. A. Hashimoto, and J. Stevens, “Wire routing by optimizing channel assignment within large apertures,” in Proc. 8th Design Automation Workshop, pp. 155–169, 1971.
13. D. N. Deutsch, “A dogleg channel router,” in Proc. I3th Design Automation Conf., pp. 425–433, June 1976.
14. B. S. Ting, and B. N. Tien, “Routing techniques for gate array,” IEEE Trans. Computer-Aided Design, vol. CAD-2, pp. 301–312, Oct. 1983.
15. T. Ohtsuki, “Maze-running and line-search algorithms,” in Layout Design and Verification, T. Ohtsuki, Ed. Amsterdam, The Netherlands: North-Holland, 1986, pp. 99–131.