Abstract
In this paper, an improved algorithm is presented for the NP-complete problem of reconfiguring a two-dimensional degradable VLSI array under the row and column routing constraints. The proposed algorithm adopts the partial computing for the logical row exclusion so that the most efficient algorithm, cited in literature, is speeded up without loss of performance. In addition, a flaw in the earlier approach is also addressed. Experimental results show that our algorithm is approximately 50% faster than the above stated algorithm.
Chapter PDF
Similar content being viewed by others
References
T. E. Mangir and A. Avizienis, “Fault-tolerant Design for VLSI: Effect of Interconnection Requirements on Yield Improvement of VLSI design”, IEEE Trans. on Computers, vol. 31, no. 7, pp. 609–615, July 1982.
J.W. Greene and A.E. Gamal, “Configuration of VLSI Array in the Presence of Defects”, J. ACM, vol. 31, no. 4, pp. 694–717, Oct. 1984.
T. Leighton and A. E. Gamal. “Wafer-scal Integration of Systoric Arrays”, IEEE Trans. on Computer, vol. 34, no. 5, pp. 448–461, May 1985.
C.W.H Lam, H.F. Li and R. Jakakumar, “A Study of Two Approaches for Reconfiguring Fault-tolerant Systoric Array”, IEEE Trans. on Computers, vol. 38, no. 6, pp. 833–844, June 1989.
I. Koren and A.D. Singh, “Fault Tolerance in VLSI Circuits”, Computer, vol. 23, no. 7, pp. 73–83, July 1990.
Y.Y. Chen, S.J. Upadhyaya and C. H. Cheng, “A Comprehensive Reconfiguration Scheme for Fault-tolerant VLSI/WSI Array Processors”, IEEE Trans. on Computers, vol. 46, no. 12, pp. 1363–1371, Dec. 1997.
T. Horita and I. Takanami, “Fault-tolerant Processor Arrays Based on the 1.5-track Switches with Flexible Spare Distributions”, IEEE Trans. on Computers, vol. 49, no. 6, pp. 542–552, June 2000.
S.Y. Kuo and W.K. Fuchs, “Efficient Spare Allocation for Reconfigurable Arrays”, IEEE Design and Test, vol. 4, no. 7, pp. 24–31, Feb. 1987.
C.L. Wey and F. Lombardi, “On the Repair of Redundant RAM’s”, IEEE Trans. on CAD of Integrated Circuits and Systems, vol. 6, no. 2, pp. 222–231, Mar. 1987.
M.G. Sami and R. Stefabelli. “Reconfigurable Architectures for VLSI Processing Arrays”, Proc. IEEE, vol. 74, no. 5, pp. 712–722, May 1986.
R. Negrini, M.G. Sami and R. Stefanelli, Fault tolerance through reconfiguration in VLSI and WSI arrays. The MIT Press, 1989
F. Distante, M.G. Sami and R. Stefanelli, “Harvesting through array partitioning: a solution to achieve defect tolerance Defect and Fault Tolerance in VLSI Systems”, Proc. 1997 IEEE International Symp. Defect and Fault Tolerance in VLSI Systems, Paris, pp. 261–269, 1997
S.Y. Kuo and I.Y. Chen, “Efficient Reconfiguration Algorithms for Degradable VLSI/WSI Arrays.” IEEE Trans. on Computer-Aided Design, vol. 11, no. 10, pp. 1289–1300, Oct. 1992.
C.P. Low and H.W. Leong, “On the Reconfiguration of Degradable VLSI/WSI Arrays”, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol. 16, no. 10, pp. 1213–1221, Oct. 1997.
C.P. Low, “An Efficient Reconfiguration Algorithm for Degradable VLSI/WSI Arrays”, IEEE Trans. on Computers, vol. 49, no. 6, pp. 553–559, June 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, J., Thambipillai, S. (2003). On the Reconfiguration Algorithm for Fault-Tolerant VLSI Arrays. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44863-2_36
Download citation
DOI: https://doi.org/10.1007/3-540-44863-2_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40196-4
Online ISBN: 978-3-540-44863-1
eBook Packages: Springer Book Archive