This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reconfiguration Algorithms for Power Efficient VLSI Subarrays with Four-Port Switches
March 2006 (vol. 55 no. 3)
pp. 243-253
Techniques to determine subarrays when processing elements of VLSI arrays become faulty have been investigated extensively. These tend to identify the largest subarray that is possible without concentrating on the power efficiency of the resulting subarray. In this paper, we propose new techniques, based on heuristic strategy and dynamic programming, to minimize the interconnect length in an attempt to reduce power dissipation without performance penalty. Our algorithms show that notable improvements in the reduction of the number of long interconnects could be realized in linear time and without sacrificing the size of the subarray. Our evaluations show that, for a VLSI array of size 256 \times 256, the number of long interconnects in the subarray can be reduced by up to 95 percent for clustered faults and up to 50 percent and 73 percent for a random fault with density of 10 percent and 0.1 percent, respectively, when compared with the most efficient implementation cited in the literature. The interconnect power saving for a VLSI array of size 512\times 512 is by up to 11 percent for a random fault. We have also shown that interconnect power savings of up to 14 percent are possible for the cases investigated. Simulations based on several random and clustered fault scenarios clearly reveal the superiority of the proposed techniques for power efficient realizations. In addition, the lower bound of the performance has been proposed to demonstrate that the proposed algorithms are nearly optimal for the cases considered in this paper.

[1] T.E. Mangir and A. Avizienis, “Fault-Tolerant Design for VLLSI: Effect of Interconnection Requirements on Yield Improvement of VLSI Design,” IEEE Trans. Computers, vol. 31, no. 7, pp. 609-615, July 1982.
[2] S.Y. Kuo and W.K. Fuchs, “Efficient Spare Allocation for Reconfigurable Arrays,” IEEE Design and Test, vol. 7, no. 4, pp. 24-31, 1987.
[3] C.L. Wey and F. Lombardi, “On the Repair of Redundant RAM's” IEEE Trans. Computer-Aided Design, vol. 6, no. 2, pp. 222-231, Mar. 1987.
[4] R. Negrini, M.G. Sami, and R. Stefanelli, Fault Tolerance through Reconfiguration in VLSI and WSI Arrays. MIT Press, 1989.
[5] C.W.H. Lam, H.F. Li, and R. Jakakumar, “A Study of Two Approaches for Reconfiguring Fault-Tolerant Systolic Array,” IEEE Trans. Computers, vol. 38, no. 6, pp. 833-844, June 1989.
[6] F. Lombardi and W.K. Huang, “ Approaches for the Repair of VLSI/WSI PRAM's by Row/Column Deletion,” Proc. 18th Int'l Symp. Fault-Tolerant Computing, pp. 342-347, 1988.
[7] I. Koren and A.D. Singh, “Fault Tolerance in VLSI Circuits,” Computer, vol. 23, no. 7, pp. 73-83, July 1990.
[8] Y.Y. Chen, S.J. Upadhyaya, and C.H. Cheng, “A Comprehensive Reconfiguration Scheme for Fault-Tolerant VLSI/WSI Array Processors,” IEEE Trans. Computers, vol. 46, no. 12, pp. 1363-1371, Dec. 1997.
[9] L. Zhang, “Fault-Tolerant Meshes with Small Degree,” IEEE Trans. Computers, vol. 51, no. 5, pp. 553-560, May 2002.
[10] T. Horita and I. Takanami, “Fault-Tolerant Processor Arrays Based on the 1.5-Track Switches with Flexible Spare Distributions,” IEEE Trans. Computers, vol. 49, no. 6, pp. 542-552, June 2000.
[11] L. LaForge, “Extremally Fault Tolerant Arrays,” Proc. Int'l Conf. Wafer Scale Integrations, pp. 365-378, Jan. 1989.
[12] F.G. Gray and T.S. White, “Summary of a Distributed Control Algorithm for a Dynamically Reconfigurable Array Architecture,” Proc. Int'l Conf. Wafer Scale Integration, pp. 131-140, Jan. 1989.
[13] J. Czechowski, E.H. Rogers, and M.J. Chung, “Architectural Yield Analysis of Random Defects in Wafer Scale Integration,” Proc. Int'l Conf. Wafer Scale Integration, pp. 215-214, Jan. 1989.
[14] S.Y. Kuo and I.Y. Chen, “Efficient Reconfiguration Algorithms for Degradable VLSI/WSI Arrays,” IEEE Trans. Computer-Aided Design, vol. 11, no. 10, pp. 1289-1300, Oct. 1992.
[15] C.P. Low and H.W. Leong, “On the Reconfiguration of Degradable VLSI/WSI Arrays,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 16, no. 10, pp. 1213-1221, Oct. 1997.
[16] C.P. Low, “An Efficient Reconfiguration Algorithm for Degradable VLSI/WSI Arrays,” IEEE Trans. Computers, vol. 49, no. 6, pp. 553-559, June 2000.
[17] W. Jigang and T. Srikanthan, “An Improved Reconfiguration Algorithm for Degradable VLSI/WSI Arrays,” J. Systems Architecture, vol. 49, pp. 23-31, 2003.
[18] W. Jigang and T. Srikanthan, “Partial Rerouting Algorithm for Reconfigurable VLSI Arrays,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 5, pp. 641-644, May 2003.
[19] W. Jigang and T. Srikanthan, “Fast Reconfiguring Mesh-Connected VLSI Arrays,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 2, pp. 949-952, May 2004.
[20] M.T. Bohr, “Interconnect Scaling— The Real Limiter to High Performance ULSI,” Proc. IEEE Int'l Electron Devices Meeting, pp. 241-244, Dec. 1995.
[21] Y. Shin and T. Sakurai, “Power Distribution Analysis of VLSI Interconnects Using Model Order Reduction,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 21, no. 6, pp. 739-745, June 2002.
[22] J.J. Cong and K.-S. Leung, “Optimal Wiresizing under Elmore Delay Model,” IEEE Trans. Computer Aided Design Integrated Circuits Systems, vol. 14, no. 3, pp. 321-336, 1995.
[23] W.J. Dally, “Interconnect-Limited VLSI Architecture,” Proc. IEEE Int'l Conf. Interconnect Technology, pp. 15-17, June 1999.
[24] M.T. Bohr, “Interconnect Scaling— The Real Limiter to High Performance ULSI,” Proc. IEEE Int'l Electronic Devices Meeting, pp. 241-244, Dec. 1995.
[25] C.-K. Cheng, J. Lillis, S. Lin, and N. Chang, Interconnect Analysis and Synthesis. Wiley, 1999.
[26] H.H. Chen and J.S. Neely, “Interconnect and Circuit Modeling Techniques for Full-Chip Power Supply Noise Analysis,” IEEE Trans. Computer, Packaging, Manufacturing Technology, Part A, vol. 21, no. 3, pp. 209-215, Aug. 1998.
[27] J. Choi, M. Swaminathan, N. Do, and R. Master, “Modeling of Power Supply Noise in Large Chips with Nonlinear Circuits,” Proc. IEEE Topical Meeting on Electrical Performance of Electronic Packaging, pp. 257-260, Oct. 2002.
[28] J.-S. Goo, S. Hale, L. Zamudio, M.M. Pelella, R. Klein, S. Butler, J.X. An, M. Lee, and A.B. Icel, “Switching-Mode Dependence of Inductive Noise in VLSI Power Bus Lines,” IEEE Electron Device Letters, vol. 25, no. 5, May 2004.
[29] M.A. El-Moursy and E.G. Friedman, “Optimum Wire Sizing of RLC Interconnect with Repeaters,” Integeration, the VLSI J., vol. 38, pp. 205-225, 2004.
[30] L.M. Lung, K. Banerjee, and A. Mehrotra, “A Global Interconnect Optimization Scheme for Nanometer Scale VLSI with Implications for Latency, Bandwidth, and Power Dissipation,” IEEE Trans. Electron Devices, vol. 51, no. 2, pp. 195-203, Feb. 2004.
[31] W. Jigang, T. Srikanthan, and C.R. Patel, “A Low Power Algorithm for Reconfigurable VLSI/WSI Arrays,” Proc. Int'l Conf. Embedded Systems and Applications, pp. 237-242, June 2003.
[32] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.

Index Terms:
Degradable VLSI array, reconfiguration, routing, fault tolerance, algorithms.
Citation:
Wu Jigang, Thambipillai Srikanthan, "Reconfiguration Algorithms for Power Efficient VLSI Subarrays with Four-Port Switches," IEEE Transactions on Computers, vol. 55, no. 3, pp. 243-253, March 2006, doi:10.1109/TC.2006.43
Usage of this product signifies your acceptance of the Terms of Use.