Efficient routability check algorithms for segmented channel routing

ACM Transactions on Design Automation of Electronic Systems

Volumn 5, Issue 3, 2000, Pages 735-747

  Yang, Cheng Hsing ^a   Chen, Sao Jie ^b   Ho, Jan Ming ^c,e   Tsai, Chia Chun ^d  

^a KUNG SHAN INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c ACADEMIA SINICA   (Taiwan)

^d NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^e INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23044523991     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/348019.348574     Document Type: Article

References (12)

1. ACTEL CORP. 1991. ACT Family FPGA Databook.
2. BURMAN, S., KAMALANATHAN, C., AND SHERWANI, N. 1992. New channel segmentation model and associated routing algorithm for high performance FPGAs. In Proceedings of the 1992 IEEE/ACM International Conference on Computer-Aided Design (ICCAD '92, Santa Clara, CA, Nov. 8-12), L. Trevillyan, Ed. IEEE Computer Society Press, Los Alamitos, CA, 22-25.
3. EL GAMAL, A., GREENE, J., AND ROYCHOWDHURY, V. 1991. Segmented channel routing in nearly as efficient as channel routing (and just as hard). In Proceedings of the 1991 University of California/Santa Cruz Conference on Advanced Research in VLSI (Edimburgh, Scotland), C. H. Séquin, Ed. MIT Press, Cambridge, MA, 192-211.
4. EL GAMAL, A., GREENE, J., REYNARI, J., ROGOYSKI, E., EL AYAT, K. A., AND MOHSEN, A. 1989. An architecture for electrically configurable gate arrays. IEEE J. Solid-State Circuits 24, 2 (Apr.), 394-398.
5. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, NY.
6. GREENE, J., ROYCHOWDHURY, V., KAPTANOGLU, S., AND GAMAL, A. E. 1990. Segmented channel routing. In Proceedings of the ACM/IEEE Conference on Design Automation (DAG '90, Orlando, FL, June 24-28), R. C. Smith, Ed. ACM Press, New York, NY, 567-572.
7. PAPADIMITRIOU, C. H. AND STEIGLITZ, K. 1982. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Upper Saddle River, NJ.
8. PEDRAM, M., NOBANDEGANI, B. S., AND PREAS, B. T. 1994. Design and analysis of segmented routing channels for row-based FPGA's. IEEE Trans. Comput.-Aided Des. 13, 12 (Dec.), 1470-1479.
9. RHEINBOLDT, W. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., New York, NY.
10. ROY, K. 1993. A bounded search algorithm for segmented channel routing for FPGA's and associated channel architecture issues. IEEE Trans. Comput.-Aided Des. 12, 11, 1695-1705.
11. ROYCHOWDHURY, V. P., GREENE, J., AND EL GAMAL, A. 1993. Segmented channel routing. IEEE Trans. Comput.-Aided Des. 12, 1, 79-95.
12. ZHU, K. AND WONG, D. F. 1992. On channel segmentation design for row-based FPGAs. In Proceedings of the 1992 IEEE/ACM International Conference on Computer-Aided Design (ICCAD '92, Santa Clara, CA, Nov. 8-12), L. Trevillyan, Ed. IEEE Computer Society Press, Los Alamitos, CA, 26-29.