This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Routability for FPGAs under Faulty Conditions
November 1995 (vol. 44 no. 11)
pp. 1296-1305

Abstract—The field programmable gate array (FPGA) routing resources are fixed and their usage is constrained by the location of programmable interconnects (PIs) such as antifuses. The routing or the interconnect delays are determined by the length of segments assigned to the nets of various lengths and the number of PIs programmed for routing of each net. Due to the use of PIs certain unconventional faults may appear. In this paper we model the PI faults and address the design and routability of the FPGA channel architecture to achieve 100% routing with minimum performance penalty in the presence of PI faults. A channel routing algorithm has also been developed which routes nets in the presence of PI faults. Experiments were performed by randomly injecting faults of different types into the routing channel and then using the routing algorithm to determine the routability of the synthesized architecture. Results on a set of industrial designs and MCNC benchmark examples show the feasibility of achieving routability with minimum performance penalty when a large number of faults are present in the channel.

[1] A.E. Gammal,J. Green,J. Reyneri,E. Rogoyski,, and A. Mohsen,“An architecture for electrically configurable gate array,” IEEE J. Solid State Circuits, vol. 24, no. 2, pp. 394-398, Apr. 1989.
[2] J. Birkner et al., “A very high speed field programmable gate array using metal to metal antifuse programming elements,” Proc. IEEE Custom Integrated Circuits Conf., pp. 171-176, May 1991.
[3] Field Programmable Gate Array—Application Handbook. Texas Instruments, 1992.
[4] H. Hsieh et al., “A 9000-gate user-programmable gate array,” Proc. IEEE Custom Integrated Circuit Conf., 1988.
[5] H. Hsieh et al., "Third-Generation Architecture Boosts Speed and Density of Field-Programmable Gate Arrays," Proc. 1990 Custom Integrated Circuits Conf., IEEE, Piscataway, N.J., 1990, pp. 31.2.1-31.2.7.
[6] D. Marple and L. Cooke,“An MPGA compatible FPGA architecture,” Proc. IEEE Custom Integrate Circuit Conf., 1992.
[7] K. Roy,“A bounded search algorithm for segmented channel routing of FPGAs and associated channel architecture issues,” IEEE Trans. Computer-Aided Design, pp. 1,695-1,705, Nov. 1993.
[8] J. Green,V. Roychowdhury,S. Kaptanaglu,, and A. Gammal,“Segmented channel routing,” Proc. IEEE/ACM Design Automation Conf., pp. 567-572, 1990.
[9] K. Roy,S. Nag,, and S. Datta,“Channel architecture optimization for performance and routability for row-based FPGAs,” Proc. IEEE Int’l Conf. Computer Design (ICCD), pp. 220-223, 1993.
[10] K. Roy and M. Mehendale,“Optimization of channel segmentation for channeled architecture FPGAs,” Proc. IEEE Custom Integrated Circuits Conf., pp. 441-443, 1992.
[11] R. Murgai,Y. Nishizaki,N. Shenoy,R. Brayton,, and A. Sangiovanni-Vincentelli,“Logic synthesis for programmable gate arrays,” ACM/IEEE Design Automation Conf., pp 620-625, 1990.
[12] K. Karplus,“Amap: A technology mapper for selector-based field-programmable gate arrays,” Proc. ACM/IEEE Design Automation Conf., pp. 244-247, 1991.
[13] S. Ercolani and G. De Micheli,“Technology mapping for electrically programmable gate arrays,” Proc. ACM/IEEE Design Automation Conf., pp. 234-239, 1991.
[14] R. Francis,J. Rose,, and K. Chung,“Chortle: A technology mapping program for lookup table-based field programmable gate arrays,” Proc. ACM/IEEE Design Automation Conf., pp. 613-619, 1990.
[15] J. Kouloheris and A. El Gamal,“FPGA performance versus cell granularity,” Proc. IEEE Custom Integrated Circuit Conf., 1991.
[16] S. Nag and K. Roy,“Iterative performance and wirability improvement for FPGAs,” Proc. IEEE/ACM Design Automation Conf., pp. 321-325, 1993.
[17] C. Stapper,“The effects of wafer to wafer defect density variations on integrated circuit defect and fault distribution,” IBM J. Research and Development, pp. 87-97, Jan. 1985.
[18] S. Kirkpatrick,C. Gellat,, and M. Vecchi,“Optimization by simulated annealing,” Science, vol. 220, no. 4,598, pp. 671-680, May 1983.
[19] M. Huang,F. Romeo,, and A. Sangiovanni-Vincentelli,“An efficient general cooling schedule for simulated annealing,” Proc. Int’l Conf. Computer-Aided Design, pp. 381-384, 1986.

Index Terms:
Routability, FPGA, fault-tolerance, faults, architecture-synthesis.
Citation:
Sudip Nag, Kaushik Roy, "On Routability for FPGAs under Faulty Conditions," IEEE Transactions on Computers, vol. 44, no. 11, pp. 1296-1305, Nov. 1995, doi:10.1109/12.475125
Usage of this product signifies your acceptance of the Terms of Use.